On the Holroyd-Talbot conjecture for sparse graphs

DOI10.1016/j.disc.2023.113742zbMath1525.05184arXiv2207.01661MaRDI QIDQ6056471

Glenn H. Hurlbert, Peter Frankl

Publication date: 30 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.01661

zbMATH Keywords

intersecting familyErdős-Ko-Rado theoremHolroyd-Talbot conjecture

Mathematics Subject Classification ID

Extremal set theory (05D05) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Stars on trees
• Maximum degree and diversity in intersecting hypergraphs
• 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 new result on Chvátal's conjecture
• An Erdős-Ko-Rado theorem for signed sets
• Erdös-Ko-Rado theorems for a family of trees
• Compression and Erdős-Ko-Rado graphs
• Graphs with the Erdős-Ko-Rado property
• An Erdős-Ko-Rado theorem for unions of length 2 paths
• On stars in caterpillars and lobsters
• On intersecting families of independent sets in trees
• 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
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• An intersection theorem for weighted sets

This page was built for publication: On the Holroyd-Talbot conjecture for sparse graphs