Erdős-Ko-Rado with conditions on the minimum complementary degree

DOI10.1016/j.jcta.2004.07.007zbMath1069.05074OpenAlexW2042608907MaRDI QIDQ1763872

John L. Goldwasser

Publication date: 22 February 2005

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.2004.07.007

zbMATH Keywords

shadowsCatalan numbersset intersectionsKruskal-Katonacolexicographic order

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An intersection problem with 6 extremes
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• Non-trivial intersecting families
• Families of finite sets with minimum shadows
• Finite projective spaces and intersecting hypergraphs
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Some best possible inequalities concerning cross-intersecting families
• Minimum shadows in uniform hypergraphs and a generalization of the Takagi function
• A simple proof of the Kruskal-Katona theorem
• 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
• THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS
• Intersection theorems for systems of finite sets
• A Combinatorial Theorem on Systems of Sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On intersecting families of finite sets
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: Erdős-Ko-Rado with conditions on the minimum complementary degree