Maximum hitting of a set by compressed intersecting families

DOI10.1007/s00373-010-1001-2zbMath1233.05193OpenAlexW2134230490MaRDI QIDQ659747

Peter Borg

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-1001-2

zbMATH Keywords

Compressed familyErdős-Ko-Rado TheoremIntersecting family

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (6)

EKR sets for large \(n\) and \(r\) ⋮ Non-trivial intersecting uniform sub-families of hereditary families ⋮ A Hilton-Milner-type theorem and an intersection conjecture for signed sets ⋮ New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems ⋮ Maximum hitting for \(n\) sufficiently large ⋮ Classification of maximum hittings by large families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-trivial intersecting families
• Some best possible inequalities concerning cross-intersecting families
• Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets
• Graphs with the Erdős-Ko-Rado property
• Erdős-Ko-Rado from Kruskal-Katona
• A simple proof of the Erdős-Chao Ko-Rado theorem
• A generalization of the Erdős-Ko-Rado theorem on finite set systems
• Erdös–Ko–Rado Theorem—22 Years Later
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On intersecting families of finite sets

This page was built for publication: Maximum hitting of a set by compressed intersecting families