The structure of large intersecting families

DOI10.1090/proc/13390zbMath1358.05039arXiv1602.01391OpenAlexW2272851450MaRDI QIDQ2970053

Dhruv Mubayi, Alexandr V. Kostochka

Publication date: 27 March 2017

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Ko-Rado theoremdelta-system method

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15) Triple systems (05B07)

Related Items

Stability on matchings in 3-uniform hypergraphs ⋮ Hypergraphs without non-trivial intersecting subgraphs ⋮ Size and structure of large \((s,t)\)-union intersecting families ⋮ Non-trivial \(t\)-intersecting families for symplectic polar spaces ⋮ Nontrivial t-Intersecting Families for Vector Spaces ⋮ A degree version of the Hilton-Milner theorem ⋮ Stability of intersecting families ⋮ The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes ⋮ Non-trivial \(d\)-wise intersecting families ⋮ On the multicolor Ramsey number for 3-paths of length three ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ A hierarchy of maximal intersecting triple systems ⋮ The structure of large non-trivial \(t\)-intersecting families of finite sets ⋮ Tight bounds for Katona's shadow intersection theorem ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ Degree versions of theorems on intersecting families via stability

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Hypergraph Turán numbers of linear cycles
• On Erdős' extremal problem on matchings in hypergraphs
• Linear trees in uniform hypergraphs
• The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family
• The Size of a Hypergraph and its Matching Number
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• On families of finite sets no two of which intersect in a singleton
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A Combinatorial Theorem
• On intersecting families of finite sets
• On intersecting families of finite sets