Maximum hitting for \(n\) sufficiently large

DOI10.1007/s00373-012-1281-9zbMath1298.05311arXiv1203.4188OpenAlexW3099179426MaRDI QIDQ742567

Ben Barber

Publication date: 19 September 2014

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

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

zbMATH Keywords

intersecting familyErdős-Ko-Rado theoremcompressiongenerating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05)

Related Items (3)

EKR sets for large \(n\) and \(r\) ⋮ Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems ⋮ Classification of maximum hittings by large families

Cites Work

• Maximum hitting of a set by compressed intersecting families
• The complete intersection theorem for systems of finite sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Unnamed Item

This page was built for publication: Maximum hitting for \(n\) sufficiently large