On large intersecting subfamilies of uniform setfamilies

DOI10.1002/rsa.10098zbMath1031.05128OpenAlexW2112627045WikidataQ105742617 ScholiaQ105742617MaRDI QIDQ4446868

Vojtěch Rödl, Richard A. Duke, Paul Erdős

Publication date: 3 February 2004

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10098

zbMATH Keywords

Erdős-Ko-Rado TheoremExtremal Set Theory

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05)

Related Items

On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs ⋮ Dependent random choice

Cites Work

• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• Cycle-connected graphs
• The Erdős-Ko-Rado theorem for small families
• On graphs with small Ramsey numbers*
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS