A polynomial criterion for DP-coloring of uncrowded hypergraphs
math.CO
Submitted: 2026-07-06
Updated: 2026-11-08
Terminology
Sources
- List coloring uncrowded hypergraphs at the shattering threshold
- A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method
- Another approach to non-repetitive colorings of graphs of bounded degree
- Hypergraph independence bounds: from maximum degree to average degree
- On independent sets in uncrowded uniform 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