Improved bounds on the maximum diversity of intersecting families
From MaRDI portal
Publication:6201878
DOI10.1016/j.ejc.2023.103885arXiv2304.11089MaRDI QIDQ6201878
Publication date: 26 March 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.11089
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The exact bound in the Erdős-Ko-Rado theorem
- Maximum degree and diversity in intersecting hypergraphs
- On finite set-systems whose every intersection is a kernel of a star
- Intersecting and cross-intersecting families of labeled sets
- The unbalance of set systems
- Non-trivial intersecting families
- A generalization of a theorem of Kruskal
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Exact solution of some Turán-type problems
- Some best possible inequalities concerning cross-intersecting families
- Two extremal problems on intersecting families
- Diversity of uniform intersecting families
- Regular bipartite graphs and intersecting families
- New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
- The complete nontrivial-intersection theorem for systems of finite sets
- A simple proof of the Hilton-Milner theorem
- Antichains of fixed diameter
- Intersecting families with sunflower shadows
- Intersections and distinct intersections in cross-intersecting families
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS
- Intersection theorems for systems of finite sets
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On intersecting families of finite sets
- Diversity
- A product version of the Hilton-Milner theorem
This page was built for publication: Improved bounds on the maximum diversity of intersecting families
