Kneser graphs are Hamiltonian for n 3k
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3838053 (Why is no real title available?)
- scientific article; zbMATH DE number 3916312 (Why is no real title available?)
- scientific article; zbMATH DE number 3478938 (Why is no real title available?)
- scientific article; zbMATH DE number 3600077 (Why is no real title available?)
- scientific article; zbMATH DE number 638692 (Why is no real title available?)
- scientific article; zbMATH DE number 1439443 (Why is no real title available?)
- A note on Hamiltonian circuits
- Binomial and q-binomial coefficient inequalities related to the hamiltonicity of the Kneser graphs and their q-analogues
- Hamiltonian uniform subset graphs
- Monotone Gray codes and the middle levels problem
- The Rugby footballers of Croam
- The antipodal layers problem
- Two Hamilton cycles in bipartite reflective Kneser graphs
Cited in
(36)- On the connectivity of the disjointness graph of segments of point sets in general position in the plane
- Kneser graphs are Hamiltonian
- Sparse Kneser graphs are Hamiltonian
- A new class of transitive graphs
- Bipartite Kneser graphs are Hamiltonian
- Four cycle decomposition of K(n, 2)
- Spectrum of Johnson graphs
- Claw-decomposition of Kneser graphs
- Hamiltonian Kneser graphs
- Two Hamilton cycles in bipartite reflective Kneser graphs
- A note on the 1-factorization of non-uniform complete hypergraph
- Kneser graphs are Hamiltonian (extended abstract)
- Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\)
- scientific article; zbMATH DE number 2059939 (Why is no real title available?)
- A minimum-change version of the Chung-Feller theorem for Dyck paths
- Sparse Kneser graphs are Hamiltonian
- An inductive construction for Hamilton cycles in Kneser graphs
- Arrangements of \(k\)-sets with intersection constraints
- S₅-decomposition of Kneser graphs
- Decomposition of the Kneser graph into paths of length four
- Short proof that Kneser graphs are Hamiltonian for n 4k
- Kneser graphs are Hamiltonian
- Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian
- Some algebraic properties of bipartite Kneser graphs.
- Triangle-free Hamiltonian Kneser graphs
- Bipartite Kneser graphs are Hamiltonian
- Graphs as navigational infrastructure for high dimensional data spaces
- On the boxicity of Kneser graphs and complements of line graphs
- On the central levels problem
- Set labelling vertices to ensure adjacency coincides with disjointness
- A constant-time algorithm for middle levels Gray codes
- Hamiltonian cycles in Kneser graphs for n=2k+2
- s-stable Kneser graphs are Hamiltonian
- A note on P_k-decomposition of the Kneser graph
- Sperner type theorems with excluded subposets
- Diameters of uniform subset graphs
This page was built for publication: Kneser graphs are Hamiltonian for \(n\geq 3k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850485)
