B. Schülke

activity

20192024

most citedMinimum pair degree condition for tight Hamiltonian cycles in

4

-uniform hypergraphs

5 citations · 5 across the 7 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

Short proof that Kneser graphs are Hamiltonian for $n \geq 4 k$

Johann Bellmann, Bjarne Schülke

For integers $n \geq k \geq 1$ , the Kneser graph $K (n, k)$ is the graph with vertex set $V = [n]^{(k)}$ and edge set $E = {{x, y} \in V^{(2)} : x \cap y = \emptyset}$ . Chen proved that for…

math.CO2019

Convex graphon parameters and graph norms

Joonkyung Lee, Bjarne Schülke

Sidorenko's conjecture states that the number of copies of a bipartite graph $H$ in a graph $G$ is asymptotically minimised when $G$ is a quasirandom graph. A notorious example whe…

math.CO2019

A pair degree condition for Hamiltonian cycles in $3$ -uniform hypergraphs

Bjarne Schülke

We prove a new sufficient pair degree condition for tight Hamiltonian cycles in $3$ -uniform hypergraphs that (asymptotically) improves the best known pair degree condition due to R…

Short proof that Kneser graphs are Hamiltonian for n≥4k

Convex graphon parameters and graph norms

A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs

Short proof that Kneser graphs are Hamiltonian for $n \geq 4 k$

A pair degree condition for Hamiltonian cycles in $3$ -uniform hypergraphs