Answers are grounded in this paper and cite their sources.
We study fractional coloring with local demands, a framework introduced by Kelly and Postle in which one seeks a probability distribution on the independent sets of a graph such that each vertex v is included with probability at least a prescribed target $ϕ(v)$. For Kᵣ-free graphs, Kelly and Postle conjectured that such a distribution exists provided ϕ(v)≤ cᵣlog d(v)/d(v) for a fixed \(c_r>0\), where $d(v)$ is the degree of v, and they established this up to a factor of (loglog d(v))². In this paper, we prove their conjecture, showing that \[ ϕ(v)/rlog(d(v)+2)/d(v)+1 \] suffices for an absolute constant $c>0$. As a corollary, we obtain a lower bound on the independence number of Kᵣ-free graphs in terms of their degree sequence. This strengthens the bound that OpenAI proved in resolving the Ajtai-Erdős-Komlós-Szemerédi conjecture. Moreover, our argument yields a deterministic algorithm that produces the desired probability distribution in time 2O(r²)nO(1), where \(n\) is the number of vertices and the implied constants are absolute.
No takes yet. Share an insight, caveat, or question.
Davies et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: