The exact bound in the Erdös-Ko-Rado theorem

1984/06/01 by Richard M. Wilson · 7 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Algebraic number #Combinatorics #Discrete mathematics #Limits and Structures in Graph Theory #Mathematics #Set (abstract data type) #Upper and lower bounds #graph theory and CDMA systems

paper · doi:10.1007/bf02579226

crossref issued 1984/06/01 · crossref published 1984/06/01 · crossref published-print 1984/06/01 · openalex publication_date 1984/06/01 · crossref created 2007/03/22 · crossref deposited 2019/05/18 · openalex created_date 2025/10/10 · crossref indexed 2026/06/13 · openalex updated_date 2026/07/29

Citations

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

Cited by

• The Erdös-Ko-Rado theorem for vector spaces
• Piercing all maximum cliques in hypergraphs
• On the measure of intersecting families, uniqueness and stability
• Non-trivial intersecting families
• P-polynomial coherent configurations
• The (t,p)-Norm in Classical Extremal Problems
• Erdős–Ko–Rado theorem [wikipedia]