Embedding spanning subgraphs in uniformly dense and inseparable graphs. - Oliver Ebsen; Giulia S. Maesaka; Christian Reiher; Mathias Schacht; Bjarne Schülke (Random Struct. Algorithms, 2020)

Maximum size of r-cross t-intersecting families. - Pranshu Gupta; Yannick Mogge; Simón Piga; Bjarne Schülke (LAGOS, 2021)

Short proof that Kneser graphs are Hamiltonian for n ⩾ 4k. - Johann Bellmann; Bjarne Schülke (Discret. Math., 2021)

On extremal problems concerning the traces of sets. - Simón Piga; Bjarne Schülke (J. Comb. Theory A, 2021)

On Hamiltonian cycles in hypergraphs with dense link graphs. - Joanna Polcyn; Christian Reiher; Vojtech Rödl; Bjarne Schülke (J. Comb. Theory B, 2021)

Covering 3-Edge-Colored Random Graphs with Monochromatic Trees. - Yoshiharu Kohayakawa; Walner Mendonça; Guilherme Oliveira Mota; Bjarne Schülke (SIAM J. Discret. Math., 2021)

Decomposing hypergraphs into cycle factors. - Felix Joos; Marcus Kühn; Bjarne Schülke (J. Comb. Theory B, 2023)

A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs. - Bjarne Schülke (Comb. Probab. Comput., 2023)

The codegree Turán density of tight cycles minus one edge. - Simón Piga; Marcelo Tadeu de Sá Oliveira Sales; Bjarne Schülke (Comb. Probab. Comput., 2023)

A Local Version of Katona's Intersecting Shadow Theorem. - Marcelo Tadeu Sales; Bjarne Schülke (Comb., 2023)