The Erdős-Ko-Rado theorem for small families

DOI10.1016/0097-3165(94)90022-1zbMath0795.05137OpenAlexW2053952053MaRDI QIDQ1320390

Vojtěch Rödl, Richard A. Duke

Publication date: 12 July 1994

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

Full work available at URL: https://doi.org/10.1016/0097-3165(94)90022-1

zbMATH Keywords

Erdős-Ko-Rado theoremregularity lemmasmall families

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (3)

Turán and Ramsey numbers in linear triple systems ⋮ Cycle-connected graphs ⋮ On large intersecting subfamilies of uniform setfamilies

Cites Work

• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Unnamed Item
• Unnamed Item

This page was built for publication: The Erdős-Ko-Rado theorem for small families