The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family
From MaRDI portal
Publication:2832808
DOI10.1090/proc/13221zbMath1350.05169arXiv1509.05464OpenAlexW3105688314WikidataQ101496384 ScholiaQ101496384MaRDI QIDQ2832808
Publication date: 14 November 2016
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.05464
Related Items (22)
Stability on matchings in 3-uniform hypergraphs ⋮ Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three ⋮ Size and structure of large \((s,t)\)-union intersecting families ⋮ Non-trivial \(t\)-intersecting families for symplectic polar spaces ⋮ The spectral radii of intersecting uniform hypergraphs ⋮ Nontrivial t-Intersecting Families for Vector Spaces ⋮ Turán and Ramsey numbers for 3‐uniform minimal paths of length 4 ⋮ 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 ⋮ Improved bounds on the maximum diversity of intersecting families ⋮ The structure of large intersecting families ⋮ Non-trivial \(d\)-wise intersecting families ⋮ On the multicolor Ramsey number for 3-paths of length three ⋮ One more Turán number and Ramsey number for the loose 3-uniform path of length three ⋮ The Hilton-Milner theorem for attenuated spaces ⋮ A hierarchy of maximal intersecting triple systems ⋮ The toughness of Kneser graphs ⋮ The structure of large non-trivial \(t\)-intersecting families of finite sets ⋮ Tight bounds for Katona's shadow intersection theorem ⋮ Classification of maximum hittings by large families ⋮ Degree versions of theorems on intersecting families via stability
Cites Work
- Non-trivial intersecting uniform sub-families of hereditary families
- Set systems without a simplex or a cluster
- Shadows and intersections: Stability and new proofs
- Non-trivial intersecting families
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Some best possible inequalities concerning cross-intersecting families
- The complete nontrivial-intersection theorem for systems of finite sets
- Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
- A new short proof of a theorem of Ahlswede and Khachatrian
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersecting Families are Essentially Contained in Juntas
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On intersecting families of finite sets
- Unnamed Item
- Unnamed Item
This page was built for publication: The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family
