The Erdős-Ko-Rado properties of set systems defined by double partitions
From MaRDI portal
Publication:1044945
DOI10.1016/j.disc.2008.05.052zbMath1193.05022OpenAlexW2060164217MaRDI QIDQ1044945
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.05.052
Related Items (9)
Erdős-Ko-Rado type theorems for simplicial complexes ⋮ Non-trivial intersecting uniform sub-families of hereditary families ⋮ On the Holroyd-Talbot conjecture for sparse graphs ⋮ Cross-intersecting non-empty uniform subfamilies of hereditary families ⋮ Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas ⋮ Stars on trees ⋮ Strongly intersecting integer partitions ⋮ The Erdős-Ko-Rado properties of various graphs containing singletons ⋮ The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An ordered version of the Erdős-Ko-Rado theorem
- An Erdős-Ko-Rado theorem for the subcubes of a cube
- More on the Erdős-Ko-Rado theorem for integer sequences
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- An Erdős-Ko-Rado theorem for signed sets
- Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets
- Compression and Erdős-Ko-Rado graphs
- Graphs with the Erdős-Ko-Rado property
- Intersecting systems of signed sets
- A generalization of the Erdős-Ko-Rado theorem on finite set systems
- Erdös–Ko–Rado Theorem—22 Years Later
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A Group-Theoretic Setting for Some Intersecting Sperner Families
- On Representatives of Subsets
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A Combinatorial Theorem
- An intersection theorem for weighted sets
This page was built for publication: The Erdős-Ko-Rado properties of set systems defined by double partitions
