Arrangements of \(k\)-sets with intersection constraints
From MaRDI portal
Publication:449216
DOI10.1016/j.ejc.2012.05.004zbMath1252.05104MaRDI QIDQ449216
Dan Pritikin, Manley Perkel, 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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- Hamiltonian uniform subset graphs
- Triangle-free Hamiltonian Kneser graphs
- Hamiltonian Kneser graphs
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- Covering by intersecting families
- A combinatorical proof of Kneser's conjecture
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On Universal Cycles for k-Subsets of an n-Set
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS