Almost All 3-uniform Hypergraphs are Class 1
math.CO, cs.DM
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Improved bounds for the chromatic index of $k$-uniform hypergraphs
- Advancing the R\"{o}dl Nibble: New bounds on matchings and the list chromatic index of hypergraphs
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