Pages that link to "Item:Q2032752"
From MaRDI portal
The following pages link to Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) (Q2032752):
Displaying 6 items.
- An inductive construction for Hamilton cycles in Kneser graphs (Q640449) (← links)
- Hamiltonian Kneser graphs (Q1603265) (← links)
- Kneser graphs are Hamiltonian for \(n\geq 3k\) (Q1850485) (← links)
- Binomial and \(q\)-binomial coefficient inequalities related to the hamiltonicity of the Kneser graphs and their \(q\)-analogues (Q1924237) (← links)
- A short proof of a theorem on Hamiltonian graphs (Q4879170) (← links)
- Pósa-type results for Berge hypergraphs (Q6574381) (← links)