An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families

DOI10.1016/j.jcta.2014.08.006zbMath1301.05316arXiv1303.0657OpenAlexW2056842939MaRDI QIDQ458297

Peter Frankl, Norihide Tokushige, Sang June Lee, Mark H. Siggers

Publication date: 7 October 2014

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

Full work available at URL: https://arxiv.org/abs/1303.0657

zbMATH Keywords

random walksErdős-Ko-Rado theoremcross-intersecting familiesshifting

Mathematics Subject Classification ID

Random walks on graphs (05C81)

Related Items (21)

The maximum product of sizes of cross-intersecting families ⋮ Multicolour Sunflowers ⋮ Fractional cross intersecting families ⋮ Cross-Intersecting Families of Vectors ⋮ The maximum product of weights of cross-intersecting families ⋮ Maximal fractional cross-intersecting families ⋮ A proof of Frankl's conjecture on cross-union families ⋮ A note on the maximum product-size of non-trivial cross \(t\)-intersecting families ⋮ The maximum measure of 3-wise \(t\)-intersecting families ⋮ A Note on Large H-Intersecting Families ⋮ Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle ⋮ Diversity ⋮ Cross-intersecting pairs of hypergraphs ⋮ Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ Invitation to intersection problems for finite sets ⋮ Erdős-Ko-Rado theorems for set partitions with certain block size ⋮ AK-type stability theorems on cross \(t\)-intersecting families ⋮ Unnamed Item ⋮ A cross‐intersection theorem for subsets of a set ⋮ Cross-intersecting families of vectors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The eigenvalue method for cross \(t\)-intersecting families
• The complete intersection theorem for systems of finite sets
• Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
• The exact bound in the Erdős-Ko-Rado theorem
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• On the hardness of approximating minimum vertex cover
• On the measure of intersecting families, uniqueness and stability
• An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
• Beyond the Erdős-Ko-Rado theorem
• The diametric theorem in Hamming spaces---optimal anticodes
• Weighted 3-wise 2-intersecting families
• On cross \(t\)-intersecting families of sets
• A simple proof of the Erdős-Chao Ko-Rado theorem
• Cross t-Intersecting Integer Sequences from Weighted Erdős–Ko–Rado
• The maximum product of sizes of cross-$t$-intersecting uniform families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The Kronecker Product of Graphs
• The Erdös-Ko-Rado Theorem for Integer Sequences
• Weighted multiply intersecting families
• A cross-intersection theorem for vector spaces based on semidefinite programming
• Families of Non-disjoint subsets
• A new generalization of the Erdős-Ko-Rado theorem
• The Erdős-Ko-Rado theorem for integer sequences

This page was built for publication: An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families