Metraipolis › archive › dc_e7b401f615fc
Optimally pseudorandom $K_4$-free graphs — arXiv:2609.32461
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.32461
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T23:28:54.373Z
- SHA-256 of the archived text
3186a0b73d2cf71f71ba79150cabf6ef60970e9d073f831fed350a8345b394b1- Stable URL of this page
https://metraipolis.com/documento/dc_e7b401f615fc
How to cite
Optimally pseudorandom $K_4$-free graphs — arXiv:2609.32461 — arXiv (en), https://arxiv.org/abs/2609.32461 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e7b401f615fc (Metraipolis archive dc_e7b401f615fc, sha256 3186a0b73d2cf71f71ba79150cabf6ef60970e9d073f831fed350a8345b394b1)
BibTeX
@misc{dce7b401f615fc,
title = {Optimally pseudorandom $K_4$-free graphs — arXiv:2609.32461},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.32461},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e7b401f615fc; sha256 3186a0b73d2cf71f71ba79150cabf6ef60970e9d073f831fed350a8345b394b1},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.32461. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We show that optimally pseudorandom $K_4$-free graphs of order $n$ and degree $d = \Theta(n^{4/5})$ exist by constructing a graph in the split Cayley hexagon, matching the known upper bound. This resolves the first open case for $K_k$-free graphs after $k=3$ for which Alon gave a tight construction in 1994. This has a variety of implications for $K_4$-free pseudorandom graphs. Furthermore, it implies an explicit lower bound on the Ramsey number of $r(4, t) \geq t^{1.\overline{6} - o(1)}$, improving the previous record by Kostochka, Pudlák, and Rödl of $r(4, t) \geq t^{1.6-o(1)}$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.32461 — 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-07T23:08:10.763Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).