EKR sets for large \(n\) and \(r\)

DOI10.1007/s00373-015-1602-xzbMath1409.05204arXiv1210.7470OpenAlexW965314771MaRDI QIDQ292246

Benjamin Bond

Publication date: 13 June 2016

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

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

zbMATH Keywords

intersecting familyErdős-Ko-Rado theoremcompressed family

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• Unnamed Item
• A new short proof of the EKR theorem
• Maximum hitting of a set by compressed intersecting families
• The complete intersection theorem for systems of finite sets
• Maximum hitting for \(n\) sufficiently large
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: EKR sets for large \(n\) and \(r\)