The Erdős-Ko-Rado properties of various graphs containing singletons
From MaRDI portal
Publication:1043643
DOI10.1016/J.DISC.2008.07.021zbMATH Open1177.05082OpenAlexW2090351536MaRDI QIDQ1043643FDOQ1043643
Authors: Peter Borg, Fred C. Holroyd
Publication date: 9 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://oro.open.ac.uk/17514/1/P_Borg_and_F_Holroyd.pdf
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Extremal set theory (05D05)
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On the maximum number of permutations with given maximal or minimal distance
- Title not available (Why is that?)
- Intersecting families of permutations
- An Erdős--Ko--Rado theorem for partial permutations
- Erdős-Ko-Rado-type theorems for colored sets
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- An Erdős-Ko-Rado theorem for signed sets
- Erdös–Ko–Rado Theorem—22 Years Later
- A Group-Theoretic Setting for Some Intersecting Sperner Families
- An Erdős-Ko-Rado theorem for the subcubes of a cube
- The Erdős-Ko-Rado properties of set systems defined by double partitions
- Compression and Erdős-Ko-Rado graphs
- Graphs with the Erdős-Ko-Rado property
- Title not available (Why is that?)
- Extremal t -intersecting sub-families of hereditary families
- Intersecting systems of signed sets
- Title not available (Why is that?)
- INTERSECTING FAMILIES OF SEPARATED SETS
- Erdős-Ko-Rado with separation conditions
Cited In (25)
- Erdős-Ko-Rado type theorems for simplicial complexes
- 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 theorems for simplicial complexes
- Restricted intersecting families on simplicial complex
- Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
- An analogue of the Erdős-Ko-Rado theorem for weak compositions
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
- On stars in caterpillars and lobsters
- On the Holroyd-Talbot conjecture for sparse graphs
- A Deza-Frankl type theorem for set partitions
- On the star of the family of independent sets in a graph
- A non-trivial intersection theorem for permutations with fixed number of cycles
- The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
- Very well-covered graphs with the Erdős-Ko-Rado property
- Cross-intersecting non-empty uniform subfamilies of hereditary families
- On intersecting families of independent sets in trees
- Erdös-Ko-Rado theorems for a family of trees
- Cross-intersecting subfamilies of levels of hereditary families
- Erdös-Ko-Rado theorem for ladder graphs
- Strongly intersecting integer partitions
- Stars on trees
- The number of s-separated k-sets in various circles
- Non-trivial intersecting uniform sub-families of hereditary families
This page was built for publication: The Erdős-Ko-Rado properties of various graphs containing singletons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043643)