The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem

DOI10.7151/DMGT.2365zbMATH Open1504.05287OpenAlexW3212482951MaRDI QIDQ2107760FDOQ2107760

Authors: Peter Borg, Carl Feghali 

Publication date: 2 December 2022

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2365

Recommendations

• Tight bounds for Katona's shadow intersection theorem
• A short proof of a cross-intersection theorem of Hilton
• On strengthenings of the intersecting shadow theorem
• scientific article; zbMATH DE number 554853
• The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
• Hajós' conjecture and cycle power graphs
• Herscovici's conjecture on products of shadow graphs of paths
• The Alexander–Hirschowitz Theorem and Related Problems
• scientific article; zbMATH DE number 24988
• Katona's intersection theorem: four proofs

zbMATH Keywords

cycleindependent set[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Ko-Rado+theorem&go=Go Erd��s-Ko-Rado theorem]intersecting familyKatona's shadow intersection theoremHilton-Spencer theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Extremal set theory (05D05)

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The complete intersection theorem for systems of finite sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Intersection theorems for systems of finite sets
• Title not available (Why is that?)
• The exact bound in the Erdős-Ko-Rado theorem
• A new short proof of the EKR theorem
• On \(t\)-intersecting families of signed sets and permutations
• Erdős-Ko-Rado from Kruskal-Katona
• A simple proof of the Erdős-Chao Ko-Rado theorem
• Erdös–Ko–Rado Theorem—22 Years Later
• The Erdős-Ko-Rado properties of various graphs containing singletons
• The Erdős-Ko-Rado properties of set systems defined by double partitions
• Compression and Erdős-Ko-Rado graphs
• Graphs with the Erdős-Ko-Rado property
• Erdős-Ko-Rado theorems for chordal graphs and trees
• Erdős-Ko-Rado theorems for simplicial complexes
• Title not available (Why is that?)
• Extremal t -intersecting sub-families of hereditary families
• Title not available (Why is that?)
• Invitation to intersection problems for finite sets
• A generalization of Talbot's theorem about King Arthur and his knights of the round table
• King Arthur and his knights with two round tables
• INTERSECTING FAMILIES OF SEPARATED SETS
• Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
• Intersecting families of sets and permutations: a survey
• The maximum product of sizes of cross-intersecting families
• New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
• Erdös-Ko-Rado theorems for a family of trees

Cited In (3)

• Tight bounds for Katona's shadow intersection theorem
• King Arthur and his knights with two round tables
• A generalization of Talbot's theorem about King Arthur and his knights of the round table

This page was built for publication: The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem

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