The maximum measure of 3-wise \(t\)-intersecting families
From MaRDI portal
Publication:2701004
DOI10.1016/j.ejc.2023.103703OpenAlexW4322755720MaRDI QIDQ2701004
Publication date: 27 April 2023
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.08685
Related Items (2)
The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes ⋮ Strong stability of 3-wise \(t\)-intersecting families
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
- The complete intersection theorem for systems of finite sets
- On the hardness of approximating minimum vertex cover
- The maximum size of 3-wise \(t\)-intersecting families
- A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
- On the measure of intersecting families, uniqueness and stability
- On Sperner families in which no k sets have an empty intersection. III
- Multiply-intersecting families
- On Sperner families satisfying an additional condition
- The diametric theorem in Hamming spaces---optimal anticodes
- Application of hypergraph Hoffman's bound to intersecting families
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- AK-type stability theorems on cross \(t\)-intersecting families
- The weighted complete intersection theorem
- Proof of a conjecture of Erdős on triangles in set-systems
- Multiply-intersecting families revisited
- Some exact results for multiply intersecting families
- Non-trivial 3-wise intersecting uniform families
- High dimensional Hoffman bound and applications in extremal combinatorics
- Counting Lattice Paths via a New Cycle Lemma
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Weighted multiply intersecting families
- A pushing-pulling method: New proofs of intersection theorems
This page was built for publication: The maximum measure of 3-wise \(t\)-intersecting families
