Improved bounds on the maximum diversity of intersecting families
From MaRDI portal
(Redirected from Publication:6201878)
Abstract: A family is called an intersecting family if for all . If then is called a star. The diversity of an intersecting family is defined as the minimum number of -sets in , whose deletion results in a star. In the present paper, we prove that for any intersecting family has diversity at most , which improves the previous best bound due to the first author. This result is derived from some strong bounds concerning the maximum degree of large intersecting families. Some related results are established as well.
Recommendations
Cites work
- A generalization of a theorem of Kruskal
- A product version of the Hilton-Milner theorem
- A simple proof of the Hilton-Milner theorem
- Antichains of fixed diameter
- Diversity
- Diversity of uniform intersecting families
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Exact solution of some Turán-type problems
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- Intersecting and cross-intersecting families of labeled sets
- Intersecting families with sunflower shadows
- Intersection theorems for systems of finite sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersections and distinct intersections in cross-intersecting families
- Maximum degree and diversity in intersecting hypergraphs
- New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
- Non-trivial intersecting families
- On finite set-systems whose every intersection is a kernel of a star
- On intersecting families of finite sets
- Regular bipartite graphs and intersecting families
- Some best possible inequalities concerning cross-intersecting families
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The complete nontrivial-intersection theorem for systems of finite sets
- THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS
- The exact bound in the Erdős-Ko-Rado theorem
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
- The unbalance of set systems
- Two extremal problems on intersecting families
Cited in
(13)- A generalization of diversity for intersecting families
- Stabilities for non-uniform t-intersecting families
- Diversity and intersecting theorems for weak compositions
- Size, diversity, minimum degree, sturdiness, dömdödöm
- Two results on set families: sturdiness and intersection
- Intersecting families with covering number 3
- On the C-diversity of intersecting k-graphs
- Maximal intersecting families revisited
- A result for hemi-bundled cross-intersecting families
- Proof of Frankl's conjecture on cross-intersecting families
- On the maximum diversity of hypergraphs with fixed matching number
- Non-uniform pairwise cross t-intersecting families
- A note on the maximum diversity of intersecting families in the symmetric group
This page was built for publication: Improved bounds on the maximum diversity of intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201878)