INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

1961/01/01 by P. ERDÓS, CHAO KO, R. RADO · 25 citations

paper · doi:10.1093/qmath/12.1.313

crossref issued 1961/01/01 · crossref published 1961/01/01 · crossref published-print 1961/01/01 · crossref created 2007/01/05 · crossref deposited 2017/08/23 · crossref indexed 2026/07/25

Cited by

• Clique number of xor-powers of Kneser graphs
• The typical algebraic shifting of a surface
• The maximum sum of sizes of non-empty cross L-intersecting families
• Sharp asymptotic bounds for uniform union-free hypergraphs
• Matching and intersection problems for non-trivial r-partite r-uniform hypergraphs
• Monophonic number of Kneser graphs and strongly 2-monophonic graphs
• An analogue of the Erd\H os Matching Conjecture for permutations with fixed number of cycles
• Cross-intersection theorems for uniform partitions of finite sets
• The Story of Sunflowers
• An EKR Theorem for the Cartesian Product of Complete Graphs
• A Composition-Based Approach to EKR Problems
• Two results on set families: sturdiness and intersection
• Maxmum Size of a Uniform Family with Bounded VC-dimension
• Triangular tensors and set-intersection problems
• Turán problems for simplicial complexes
• Generalizations of the Erdős Matching Conjecture for the t-Matching Number
• A complete t-intersection theorem for families of spanning trees
• Graphical Designs find Combinatorial Structures
• A remark on the t-intersecting Erdős-Ko-Rado theorem
• Hypergraph Turán problem of the generalized triangle with bounded matching number
• s-almost cross-t-intersecting families for finite sets
• On the Erdős-Ko-Rado problem of flags with type \1, n-3 \ of finite sets
• The overflow in the Katona Theorem
• q-analogues of Fisher's inequality and oddtown theorem
• Erdős–Ko–Rado theorem [wikipedia]