Compression and Erdős-Ko-Rado graphs
From MaRDI portal
Publication:1779494
DOI10.1016/j.disc.2004.08.041zbMath1064.05141OpenAlexW1995238527MaRDI QIDQ1779494
Claire Spencer, John Talbot, F. C. Holroyd
Publication date: 1 June 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.08.041
Related Items (35)
The maximum product of sizes of cross-intersecting families ⋮ The number of s-separated k-sets in various circles ⋮ The maximum sum of sizes of cross-intersecting families of subsets of a set ⋮ On intersecting families of independent sets in trees ⋮ Non-trivial intersecting uniform sub-families of hereditary families ⋮ An analogue of the Erdős-Ko-Rado theorem for weak compositions ⋮ Cross-intersecting subfamilies of levels of hereditary families ⋮ A short proof of an Erdős-Ko-Rado theorem for compositions ⋮ On the Holroyd-Talbot conjecture for sparse graphs ⋮ An Erdős-Ko-Rado theorem for permutations with fixed number of cycles ⋮ Cross-intersecting non-empty uniform subfamilies of hereditary families ⋮ Very well-covered graphs with the Erdős-Ko-Rado property ⋮ The maximum product of weights of cross-intersecting families ⋮ Erdös-Ko-Rado theorems for a family of trees ⋮ A non-trivial intersection theorem for permutations with fixed number of cycles ⋮ On the star of the family of independent sets in a graph ⋮ Erdős-Ko-Rado theorems for chordal graphs and trees ⋮ Erdős-Ko-Rado theorems for simplicial complexes ⋮ Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas ⋮ Erdös-Ko-Rado theorem for ladder graphs ⋮ A sharp bound for the product of weights of cross-intersecting families ⋮ Erdős-Ko-Rado theorems of labeled sets ⋮ Stars on trees ⋮ An Erdős-Ko-Rado theorem for unions of length 2 paths ⋮ Graphs with the Erdős-Ko-Rado property ⋮ Erdős-Ko-Rado theorems on the weak Bruhat lattice ⋮ On stars in caterpillars and lobsters ⋮ Strongly intersecting integer partitions ⋮ The EKR property for flag pure simplicial complexes without boundary ⋮ A generalization of Talbot's theorem about King Arthur and his knights of the round table ⋮ The Erdős-Ko-Rado properties of various graphs containing singletons ⋮ The Erdős-Ko-Rado properties of set systems defined by double partitions ⋮ A cross‐intersection theorem for subsets of a set ⋮ A Deza-Frankl type theorem for set partitions ⋮ The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
Cites Work
- Unnamed Item
- Unnamed Item
- The complete intersection theorem for systems of finite sets
- 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 Erdős-Ko-Rado theorem for integer sequences of given rank
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- Intersection theorems for systems of finite vector spaces
- On the maximum number of permutations with given maximal or minimal distance
- An Erdős-Ko-Rado theorem for signed sets
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Erdös–Ko–Rado Theorem—22 Years Later
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A Group-Theoretic Setting for Some Intersecting Sperner Families
- INTERSECTING FAMILIES OF SEPARATED SETS
- The Erdös-Ko-Rado Theorem for Integer Sequences
This page was built for publication: Compression and Erdős-Ko-Rado graphs
