A generalization of Talbot's theorem about King Arthur and his knights of the round table
DOI10.1016/J.JCTA.2009.02.001zbMATH Open1211.05115OpenAlexW1988731133MaRDI QIDQ1024989FDOQ1024989
Claire Spencer, A. 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
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
cyclesindependent setsfinite setsintersection theorem[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Ko-Rado&go=Go Erd��s-Ko-Rado]King Arthurround table
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38)
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- An Erdős-Ko-Rado theorem for signed sets
- Erdős-Ko-Rado from Kruskal-Katona
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Title not available (Why is that?)
- An Erdős-Ko-Rado theorem for the subcubes of a cube
- Title not available (Why is that?)
- Compression and Erdős-Ko-Rado graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- INTERSECTING FAMILIES OF SEPARATED SETS
- More on the Erdős-Ko-Rado theorem for integer sequences
- An Erdős-Ko-Rado theorem for integer sequences of given rank
Cited In (7)
- An Erdős-Ko-Rado theorem for unions of length 2 paths
- Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
- 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
- The number of s-separated k-sets in various circles
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)
