Erdös-Ko-Rado theorems for a family of trees
From MaRDI portal
Publication:1693176
DOI10.1016/j.dam.2017.10.009zbMath1377.05031arXiv1506.07741OpenAlexW2949297927MaRDI QIDQ1693176
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.07741
Trees (05C05) Extremal set theory (05D05) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
The number of s-separated k-sets in various circles ⋮ On intersecting families of independent sets in trees ⋮ Cross-intersecting subfamilies of levels of hereditary families ⋮ On the Holroyd-Talbot conjecture for sparse graphs ⋮ Very well-covered graphs with the Erdős-Ko-Rado property ⋮ On the star of the family of independent sets in a graph ⋮ Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas ⋮ On stars in caterpillars and lobsters ⋮ The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
Cites Work
- Unnamed Item
- A new short proof of the EKR theorem
- Stars on trees
- Strongly intersecting integer partitions
- 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
- Compression and Erdős-Ko-Rado graphs
- Graphs with the Erdős-Ko-Rado property
- Erdős-Ko-Rado theorems for chordal graphs and trees
- Erdös–Ko–Rado Theorem—22 Years Later
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Extremal t -intersecting sub-families of hereditary families
- INTERSECTING FAMILIES OF SEPARATED SETS
- Intersection theorems for systems of finite sets
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
This page was built for publication: Erdös-Ko-Rado theorems for a family of trees