Johann Bellmann

collaborators

2 papers

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

Clique factors in Kneser graphs

Johann Bellmann, Bjarne Schülke

For $k, n \in N$ , 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 $n\g…

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

Clique factors in Kneser graphs

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