A degree version of the Hilton-Milner theorem
From MaRDI portal
Publication:1689057
DOI10.1016/j.jcta.2017.11.019zbMath1377.05189arXiv1703.03896OpenAlexW2606666068MaRDI QIDQ1689057
Jie Han, Yi Zhao, Peter Frankl, Hao Huang
Publication date: 12 January 2018
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.03896
Related Items (8)
Stability on matchings in 3-uniform hypergraphs ⋮ Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition ⋮ Extremal \(t\)-intersecting families for direct products ⋮ The spectral radii of intersecting uniform hypergraphs ⋮ On the random version of the Erdős matching conjecture ⋮ Non-trivial \(d\)-wise intersecting families ⋮ Refuting conjectures in extremal combinatorics via linear programming ⋮ Degree versions of theorems on intersecting families via stability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds for Erdős' matching conjecture
- A note on Huang-Zhao theorem on intersecting families with large minimum degree
- Invitation to intersection problems for finite sets
- The exact bound in the Erdős-Ko-Rado theorem
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Top-down lower bounds for depth-three circuits
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
- An Erdös-Ko-Rado theorem for direct products
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family
- The structure of large intersecting families
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- A general 2-part Erdȍs-Ko-Rado theorem
- A hierarchy of maximal intersecting triple systems
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On intersecting families of finite sets
This page was built for publication: A degree version of the Hilton-Milner theorem
