Proves an improved lower bound g(r) ≥ (61/20 - o(1))r for the minimum number of edges in an r-uniform intersecting hypergraph with cover number r.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Improved Lower Bound for the Erd\H{o}s-Lov\'asz Cover Number Problem
Proves an improved lower bound g(r) ≥ (61/20 - o(1))r for the minimum number of edges in an r-uniform intersecting hypergraph with cover number r.