A generalization of Talbot's theorem about King Arthur and his knights of the round table
From MaRDI portal
Publication:1024989
DOI10.1016/j.jcta.2009.02.001zbMath1211.05115MaRDI QIDQ1024989
Anthony 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
cycles; independent sets; finite sets; intersection theorem; Erdös-Ko-Rado; King Arthur; round table
05C38: Paths and cycles
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
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