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

DOI10.1016/J.JCTA.2009.02.001MaRDI QIDQ1024989zbMATH OpenOpenAlexFDO

Authors A. J. W. Hilton, Claire Spencer

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 theoremKing Arthurround tableErdös-Ko-Rado

Mathematics Subject Classification ID

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

Recommendations

• King Arthur and his knights with two round tables
• A short proof of Talbot's theorem for intersecting separated sets
• scientific article; zbMATH DE number 3215864
• The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
• Maximal and maximum independent sets in graphs with at mostr cycles

Cites work

• scientific article; zbMATH DE number 5130735 (Why is no real title available?)
• scientific article; zbMATH DE number 3974960 (Why is no real title available?)
• scientific article; zbMATH DE number 3461973 (Why is no real title available?)
• scientific article; zbMATH DE number 3472087 (Why is no real title available?)
• A simple proof of the Erdős-Chao Ko-Rado theorem
• An Erdős-Ko-Rado theorem for integer sequences of given rank
• An Erdős-Ko-Rado theorem for signed sets
• An Erdős-Ko-Rado theorem for the subcubes of a cube
• Compression and Erdős-Ko-Rado graphs
• Erdős-Ko-Rado from Kruskal-Katona
• INTERSECTING FAMILIES OF SEPARATED SETS
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• More on the Erdős-Ko-Rado theorem for integer sequences
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

Cited in

(8)

• An Erdős-Ko-Rado theorem for unions of length 2 paths
• King Arthur and his knights with two round tables
• Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
• The number of \(s\)-separated \(k\)-sets in various circles
• The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
• A short proof of Talbot's theorem for intersecting separated sets
• Erdös-Ko-Rado theorems for a family of trees
• Stars on trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024989)