Metraipolis › archive › dc_8e4bc0fd030a

Fractional colorings of $K_r$-free graphs with local demands — arXiv:2611.04297

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04297
License (as archived)
CC0-1.0
Archived
2026-11-04T19:00:17.017Z
SHA-256 of the archived text
c5295edd1e6dcb2359b733b461e3a308201fe30587ab43fdcea5b26f748f7f8a
Stable URL of this page
https://metraipolis.com/documento/dc_8e4bc0fd030a

How to cite

Fractional colorings of $K_r$-free graphs with local demands — arXiv:2611.04297 — arXiv (en), https://arxiv.org/abs/2611.04297 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8e4bc0fd030a (Metraipolis archive dc_8e4bc0fd030a, sha256 c5295edd1e6dcb2359b733b461e3a308201fe30587ab43fdcea5b26f748f7f8a)
BibTeX
@misc{dc8e4bc0fd030a,
  title = {Fractional colorings of $K_r$-free graphs with local demands — arXiv:2611.04297},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04297},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8e4bc0fd030a; sha256 c5295edd1e6dcb2359b733b461e3a308201fe30587ab43fdcea5b26f748f7f8a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04297. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\phi(v)$. For $K_r$-free graphs, Kelly and Postle conjectured that such a distribution exists provided $\phi(v)\le c_r\frac{\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 $(\log\log d(v))^2$. In this paper, we prove their conjecture, showing that \[ \phi(v)\le\frac{c}{r}\frac{\log(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_r$-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 $2^{O(r^2)}n^{O(1)}$, where \(n\) is the number of vertices and the implied constants are absolute.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.04297 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T18:38:22.305Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).