Arrangements of k-sets with intersection constraints

DOI10.1016/J.EJC.2012.05.004MaRDI QIDQ449216zbMATH OpenOpenAlexFDO

Authors Manley Perkel, Dan Pritikin, Tao Jiang

Publication date 12 September 2012

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2012.05.004

zbMATH Keywords

Kneser graphHamiltonian cyclesKneser's conjecture

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Extremal set theory (05D05)

Recommendations

• scientific article; zbMATH DE number 2242531
• scientific article; zbMATH DE number 1537567
• scientific article; zbMATH DE number 1457591
• scientific article; zbMATH DE number 4023340
• Pairwise intersections and forbidden configurations
• Pairwise intersections and forbidden configurations
• scientific article; zbMATH DE number 5206701
• \(k\)-configurations
• Complete intersection problems for finite permutations
• scientific article; zbMATH DE number 1017097

Cites work

• scientific article; zbMATH DE number 3600077 (Why is no real title available?)
• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• A combinatorical proof of Kneser's conjecture
• Covering by intersecting families
• Hamiltonian Kneser graphs
• Hamiltonian uniform subset graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Kneser graphs are Hamiltonian for \(n\geq 3k\)
• Kneser's conjecture, chromatic number, and homotopy
• On Universal Cycles for k-Subsets of an n-Set
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Triangle-free Hamiltonian Kneser graphs

Cited in

(2)

• On the bandwidth of the Kneser graph
• Algorithmic construction of sets for k -restrictions

This page was built for publication: Arrangements of \(k\)-sets with intersection constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449216)