The maximum measure of non-trivial 3-wise intersecting families
From MaRDI portal
Publication:6120852
DOI10.1007/s10107-023-01969-xarXiv2203.17158OpenAlexW4376109284MaRDI QIDQ6120852
Publication date: 21 February 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.17158
Cites Work
- Unnamed Item
- Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families
- Contributions to the geometry of Hamming spaces
- The diametric theorem in Hamming spaces---optimal anticodes
- More complete intersection theorems
- A semidefinite programming approach to a cross-intersection problem with measures
- The complete nontrivial-intersection theorem for systems of finite sets
- On cross \(t\)-intersecting families of sets
- Refuting conjectures in extremal combinatorics via linear programming
- Extending Muirhead's inequality
- Application of hypergraph Hoffman's bound to intersecting families
- Non-trivial \(d\)-wise intersecting families
- Brace-Daykin type inequalities for intersecting families
- Weighted non-trivial multiply intersecting families
- Non-trivial 3-wise intersecting uniform families
- High dimensional Hoffman bound and applications in extremal combinatorics
- Approximation Algorithms and Semidefinite Programming
- Weighted multiply intersecting families
- A cross-intersection theorem for vector spaces based on semidefinite programming
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A finite set covering theorem
This page was built for publication: The maximum measure of non-trivial 3-wise intersecting families