A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families
From MaRDI portal
(Redirected from Publication:5222551)
Recommendations
- On the maximum number of points in a maximal intersecting family of finite sets
- An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
- A new construction of non-extendable intersecting families of sets
- Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem
- Erdős-Ko-Rado theorem with conditions on the maximal degree
Cites work
- An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
- Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- Inequalities for minimal covering sets in set systems of given rank
Cited in
(11)- On the maximum number of points in a maximal intersecting family of finite sets
- Pseudo sunflowers
- Extremal problems in hypergraph colourings
- Diversity
- Uniform intersecting families with large covering number
- On the size of maximal intersecting families
- Critically intersecting hypergraphs
- Intersecting families with covering number 3
- New bounds on families without large sunflowers
- Best possible bounds on the double-diversity of intersecting hypergraphs
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
This page was built for publication: A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222551)
