Non-trivial \(d\)-wise intersecting families
From MaRDI portal
Publication:2221841
DOI10.1016/j.jcta.2020.105369zbMath1466.05208arXiv1911.01031OpenAlexW3110642616MaRDI QIDQ2221841
Jason O'Neill, Jacques Verstraete
Publication date: 2 February 2021
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.01031
Related Items (5)
The maximum measure of non-trivial 3-wise intersecting families ⋮ Non-trivial \(r\)-wise intersecting families ⋮ The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes ⋮ Non-trivial 3-wise intersecting uniform families ⋮ \(r\)-cross \(t\)-intersecting families for vector spaces
Cites Work
- Improved bounds for Erdős' matching conjecture
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- On finite set-systems whose every intersection is a kernel of a star
- Exact solution of some Turán-type problems
- Extremal set systems with restricted \(k\)-wise intersections.
- A degree version of the Hilton-Milner theorem
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
- 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
- A survey of Turán problems for expansions
- The structure of large intersecting families
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Properties of Systems of Finite Sets
- Extremal Problems for Finite Sets
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A finite set covering theorem
This page was built for publication: Non-trivial \(d\)-wise intersecting families
