Intersecting \(P\)-free families

DOI10.1016/j.jcta.2017.04.009zbMath1366.05112arXiv1506.00864OpenAlexW598990766MaRDI QIDQ2363358

Abhishek Methuku, Casey Tompkins, Dániel Gerbner

Publication date: 13 July 2017

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.00864

zbMATH Keywords

butterflyantichainforbidden poset\(k\)-Sperner familyintersecting set family

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items

On the sizes of \(t\)-intersecting \(k\)-chain-free families, Analogues of Milner's theorem for families without long chains and of vector spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Diamond-free families
• Intersecting Sperner families and their convex hulls
• A simple proof of a theorem of Milner
• Another simple proof of a theorem of Milner
• Sperner systems consisting of pairs of complementary subsets
• The partition method for poset-free families
• Profile polytopes of some classes of families
• A simple proof of the Erdős-Chao Ko-Rado theorem
• Largest family without \(A \cup B \subseteq C \cap D\)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The method of double chains for largest families with excluded subposets
• A Combinatorial Theorem on Systems of Sets
• A Dual of Dilworth's Decomposition Theorem
• On a lemma of Littlewood and Offord