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

DOI10.7151/DMGT.2365MaRDI QIDQ2107760zbMATH OpenOpenAlexFDO

Authors Peter Borg, Carl Feghali

Publication date 2 December 2022

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

cycleindependent setintersecting familyKatona's shadow intersection theoremHilton-Spencer theoremErdős-Ko-Rado 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)

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

Cites work

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

Cited in

(3)

• 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
• Tight bounds for Katona's shadow intersection theorem

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)