Quadratic bounds for intersecting hypergraphs: An affirmative answer to a question of Duke and Erd s
math.CO
Submitted: 2026-11-01
Updated: 2026-11-01
Terminology
Sources
- Intersecting hypergraphs with large cover number
- An Improved Lower Bound for the Erd\H{o}s-Lov'asz Cover Number Problem
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality