Kneser graphs are Hamiltonian for n 3k

DOI10.1006/JCTB.2000.1969MaRDI QIDQ1850485zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ya-Chen Chen

Publication date 10 December 2002

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.2000.1969

zbMATH Keywords

antipodal layer problemErdős revolving door problemGray codeHamiltonian cyclesuniform subset graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Bipartite Kneser graphs are Hamiltonian
• Sparse Kneser graphs are Hamiltonian
• Sparse Kneser graphs are Hamiltonian
• Hamiltonian Kneser graphs
• Short proof that Kneser graphs are Hamiltonian for n 4k

Cites work

• 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
• 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?)
• Monotone Gray codes and the middle levels problem
• The antipodal layers problem
• The Rugby footballers of Croam
• Two Hamilton cycles in bipartite reflective Kneser graphs

Cited in

(38)

• Two Hamilton cycles in bipartite reflective Kneser graphs
• Triangle-free Hamiltonian Kneser graphs
• Hamiltonian Kneser graphs
• Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\)
• Binomial and q-binomial coefficient inequalities related to the hamiltonicity of the Kneser graphs and their q-analogues
• Short proof that Kneser graphs are Hamiltonian for n 4k
• Spectrum of Johnson graphs
• A constant-time algorithm for middle levels Gray codes
• Decomposition of the Kneser graph into paths of length four
• Set labelling vertices to ensure adjacency coincides with disjointness
• 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
• Hamiltonian cycles in Kneser graphs for n=2k+2
• Sperner type theorems with excluded subposets
• scientific article; zbMATH DE number 2059939 (Why is no real title available?)
• Arrangements of \(k\)-sets with intersection constraints
• Sparse Kneser graphs are Hamiltonian
• Some algebraic properties of bipartite Kneser graphs.
• S₅-decomposition of Kneser graphs
• Claw-decomposition of Kneser graphs
• Sparse Kneser graphs are Hamiltonian
• Bipartite Kneser graphs are Hamiltonian
• Bipartite Kneser graphs are Hamiltonian
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• On the connectivity of the disjointness graph of segments of point sets in general position in the plane
• Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian
• An inductive construction for Hamilton cycles in Kneser graphs
• Kneser graphs are Hamiltonian
• s-stable Kneser graphs are Hamiltonian
• A note on P_k-decomposition of the Kneser graph
• Four cycle decomposition of K(n, 2)
• A note on the 1-factorization of non-uniform complete hypergraph
• Kneser graphs are Hamiltonian (extended abstract)
• Kneser graphs are Hamiltonian
• Title not available (Why is no real title available?)
• A new class of transitive graphs
• 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)