Arrangements of k-sets with intersection constraints

DOI10.1016/J.EJC.2012.05.004zbMATH Open1252.05104OpenAlexW2063833984MaRDI QIDQ449216FDOQ449216

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

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

zbMATH Keywords

Kneser graphHamiltonian cyclesKneser's conjecture

Mathematics Subject Classification ID

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

Cites Work

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

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)