Fractional colorings of K r-free graphs with local demands
math.CO
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Pairwise optimal coupling of multiple random variables
- On the Lov'asz Theta function for Independent Sets in Sparse Graphs
- Toward Vu's conjecture
- A new lower bound for the Ramsey numbers $R(3,k)$
- Graph structure via local occupancy
- An algorithmic framework for colouring locally sparse graphs
- Fractional coloring via entropy
- Independent sets and colorings of $K_{t,t,t}$-free graphs
- Improving $R(3,k)$ in just two bites
- Colouring locally sparse graphs with the first moment method
- A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method
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