A generalization of Talbot's theorem about King Arthur and his knights of the round table

DOI10.1016/j.jcta.2009.02.001zbMath1211.05115OpenAlexW1988731133MaRDI QIDQ1024989

Claire Spencer, Anthony J. W. Hilton

Publication date: 18 June 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2009.02.001

zbMATH Keywords

cyclesindependent setsfinite setsintersection theoremErdös-Ko-RadoKing Arthurround table

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

The number of s-separated k-sets in various circles ⋮ Erdös-Ko-Rado theorems for a family of trees ⋮ Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas ⋮ Stars on trees ⋮ An Erdős-Ko-Rado theorem for unions of length 2 paths ⋮ A short proof of Talbot's theorem for intersecting separated sets ⋮ The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 Erdős-Ko-Rado theorem for signed sets
• Compression and Erdős-Ko-Rado graphs
• Erdős-Ko-Rado from Kruskal-Katona
• A simple proof of the Erdős-Chao Ko-Rado theorem
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• INTERSECTING FAMILIES OF SEPARATED SETS
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: A generalization of Talbot's theorem about King Arthur and his knights of the round table