On r-Cross Intersecting Families of Sets

DOI10.1017/S0963548311000289zbMath1283.05259MaRDI QIDQ3103624

Norihide Tokushige, Peter Frankl

Publication date: 8 December 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548311000289

Mathematics Subject Classification ID

05D05: Extremal set theory

Related Items

Multicolour Sunflowers, Unnamed Item, r$r$‐Cross t$t$‐intersecting families via necessary intersection points, The eigenvalue method for cross \(t\)-intersecting families, A product version of the Erdős-Ko-Rado theorem, Multiply union families in \(\mathbb{N}^n\), Invitation to intersection problems for finite sets, A non-trivial intersection theorem for permutations with fixed number of cycles, Old and new applications of Katona's circle, On the arithmetic mean of the size of cross-union families, On the size of the product of overlapping families, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Erdős-Ko-Rado theorems for set partitions with certain block size, On \(r\)-cross \(t\)-intersecting families for weak compositions, A Deza-Frankl type theorem for set partitions, Set systems with restricted \(k\)-wise \(\mathcal{L}\)-intersections modulo a prime number

Cites Work

• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• On Sperner families in which no k sets have an empty intersection. III
• Multiply-intersecting families
• On Sperner families satisfying an additional condition
• Shadows and intersections in vector spaces
• Proof of a conjecture of Erdős on triangles in set-systems
• On cross-intersecting families of sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On generalized graphs
• A new generalization of the Erdős-Ko-Rado theorem