Metraipolis › archive › dc_b57cc39f7c4d
Improved Explicit and Algorithmic Lower Bounds for r(5,t) — arXiv:2610.06969
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.06969
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:52:58.632Z
- SHA-256 of the archived text
8022f60e18d57f0922b39d18d6a1a7178bcb8423ffa634107b3544e090e57816- Stable URL of this page
https://metraipolis.com/documento/dc_b57cc39f7c4d
How to cite
Improved Explicit and Algorithmic Lower Bounds for r(5,t) — arXiv:2610.06969 — arXiv (en), https://arxiv.org/abs/2610.06969 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b57cc39f7c4d (Metraipolis archive dc_b57cc39f7c4d, sha256 8022f60e18d57f0922b39d18d6a1a7178bcb8423ffa634107b3544e090e57816)
BibTeX
@misc{dcb57cc39f7c4d,
title = {Improved Explicit and Algorithmic Lower Bounds for r(5,t) — arXiv:2610.06969},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.06969},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b57cc39f7c4d; sha256 8022f60e18d57f0922b39d18d6a1a7178bcb8423ffa634107b3544e090e57816},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06969. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We modify a construction of Bradač \cite{Bradac26} using a vertex ordering to give, for every prime power $q$, an explicit $K_5$ free graph with more than $q^7$ vertices and independence number below $600q^4$. This shows $$r(5,t)=\Omega(t^{7/4}).$$ Additionally, pruning a graph defined by the Coulter and Matthews polynomial $X^{14}$ \cite{CM}, we give a deterministic polynomial time construction proving $$r(5,t)=\Omega\bigl(t^{20/11-\varepsilon}\bigr)$$ for every fixed $\varepsilon>0$. These results improve the constructive lower bound $\Omega(t^{5/3})$ of Kostochka, Pudlák and Rödl \cite{KPR}.
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.06969 — 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-10-07T11:22:09.521Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).