Metraipolis › archive › dc_210429adfef7
Bounds on the maximum denominator of fractional chromatic numbers — arXiv:2610.41771
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41771
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T08:00:21.875Z
- SHA-256 of the archived text
b2cd62070026c04c448651061550a415c0e4bc095b4a4fd757ecc41d53a4ef7a- Stable URL of this page
https://metraipolis.com/documento/dc_210429adfef7
How to cite
Bounds on the maximum denominator of fractional chromatic numbers — arXiv:2610.41771 — arXiv (en), https://arxiv.org/abs/2610.41771 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_210429adfef7 (Metraipolis archive dc_210429adfef7, sha256 b2cd62070026c04c448651061550a415c0e4bc095b4a4fd757ecc41d53a4ef7a)
BibTeX
@misc{dc210429adfef7,
title = {Bounds on the maximum denominator of fractional chromatic numbers — arXiv:2610.41771},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41771},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_210429adfef7; sha256 b2cd62070026c04c448651061550a415c0e4bc095b4a4fd757ecc41d53a4ef7a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41771. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For a positive rational number $x=p/q$, where $p$ and $q$ are coprime positive integers, let $\operatorname{den}(x)=q$. For a positive integer $n$, let $\operatorname{sd}(n)=\max\{\operatorname{den}(\chi_f(G)): |V(G)|=n\}$. Let $D(n)=2^{-n}(n+1)^{(n+1)/2}$. It was proved by Alon, Tuza and Voigt that $\operatorname{sd}(n)\le D(n)$. In this paper, we prove that $\operatorname{sd}(n)\le D(n)n^{-\frac12\log_2 n+\frac14\log_2\log_2 n+O(1)}$ for all sufficiently large $n$. For the lower bound on $\operatorname{sd}(n)$, it was recently proved by Bonamy, Hylasová, Kaiser and Sereni that $\limsup_{n\to\infty}\operatorname{sd}(n)^{1/n}\ge\sqrt{2}$. We prove that $\limsup_{n\to\infty}\operatorname{sd}(n)^{1/n}\ge 3^{1/3}>\sqrt{2}$.
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/2610.41771 — 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-02T07:42:45.744Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).