Graphs with the Erdős-Ko-Rado property
From MaRDI portal
Publication:1779495
DOI10.1016/j.disc.2004.08.028zbMath1064.05142arXivmath/0307073OpenAlexW2083241416MaRDI QIDQ1779495
Publication date: 1 June 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0307073
Related Items (36)
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 ⋮ On Chvàtal's conjecture and a conjecture on families of signed sets ⋮ Non-trivial intersecting uniform sub-families of hereditary families ⋮ A Hilton-Milner-type theorem and an intersection conjecture for signed sets ⋮ An analogue of the Erdős-Ko-Rado theorem for weak compositions ⋮ Cross-intersecting subfamilies of levels of hereditary families ⋮ 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 ⋮ The covering lemma and q-analogues of extremal set theory problems ⋮ 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 ⋮ Restricted intersecting families on simplicial complex ⋮ Maximum hitting of a set by compressed intersecting families ⋮ Erdös-Ko-Rado theorem for ladder graphs ⋮ A sharp bound for the product of weights of cross-intersecting families ⋮ Stars on trees ⋮ An Erdős-Ko-Rado theorem for unions of length 2 paths ⋮ On stars in caterpillars and lobsters ⋮ Strongly intersecting integer partitions ⋮ The EKR property for flag pure simplicial complexes without boundary ⋮ On \(t\)-intersecting families of signed sets and permutations ⋮ 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
- 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
- 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
- Some covering concepts in graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Graphs with the Erdős-Ko-Rado property
