B. Schülke

activity

20202026

most citedHypergraphs with arbitrarily small codegree Turán density

1 citations · 2 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2026

Upper bounds on the running time of bootstrap percolation

Weichan Liu, Xiangxiang Nie, Simón Piga +1

For $k$ -graphs $F$ and $H_{0}$ the $F$ -bootstrap percolation process (or $F$ -process) starting with $H_{0}$ is a sequence $(H_{i})_{i \geq 0}$ of $k$ -graphs such that $H_{i + 1}$ is obtained…

math.CO2023★ 1 cited

Hypergraphs with arbitrarily small codegree Turán density

Simón Piga, Bjarne Schülke

Let $k \geq 3$ . Given a $k$ -uniform hypergraph $H$ , the minimum codegree $δ (H)$ is the largest $d \in N$ such that every $(k - 1)$ -set of $V (H)$ is contained in at least $d$ ed…

math.CO2022★ 1 cited

Beyond the broken tetrahedron

August Y. Chen, Bjarne Schülke

Here we consider the hypergraph Turán problem in uniformly dense hypergraphs as was suggested by Erdős and Sós. Given a $3$ -graph $F$ , the uniform Turán density $π_{u} (F)$ of $F$ is…

math.CO2020

On Hamiltonian cycles in hypergraphs with dense link graphs

Joanna Polcyn, Christian Reiher, Vojtěch Rödl +1

We show that every $k$ -uniform hypergraph on $n$ vertices whose minimum $(k - 2)$ -degree is at least $(5/9 + o (1)) n^{2} /2$ contains a Hamiltonian cycle. A construction due to Han and Zha…