Metraipolis › archive › dc_df289c28564d

The Erdős--Hajnal hypergraph Ramsey problem for $r_4(6,n)$ — arXiv:2609.26563

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.26563
License (as archived)
CC0-1.0
Archived
2026-10-08T15:56:05.921Z
SHA-256 of the archived text
20b7161ea093ecc3170db4a4d97085b3a605b5cd5edabe9748e89ec563980153
Stable URL of this page
https://metraipolis.com/documento/dc_df289c28564d

How to cite

The Erdős--Hajnal hypergraph Ramsey problem for $r_4(6,n)$ — arXiv:2609.26563 — arXiv (en), https://arxiv.org/abs/2609.26563 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_df289c28564d (Metraipolis archive dc_df289c28564d, sha256 20b7161ea093ecc3170db4a4d97085b3a605b5cd5edabe9748e89ec563980153)
BibTeX
@misc{dcdf289c28564d,
  title = {The Erdős--Hajnal hypergraph Ramsey problem for $r_4(6,n)$ — arXiv:2609.26563},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.26563},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_df289c28564d; sha256 20b7161ea093ecc3170db4a4d97085b3a605b5cd5edabe9748e89ec563980153},
  year = {2026}
}

Archived text

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

The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. Erdős and Hajnal conjectured that for every fixed $s>k\ge 4$, one has $r_k(s,n)\ge \operatorname{twr}_{k-1}(\Omega(n))$. This conjecture was independently verified by Mubayi and Suk, and by Conlon, Fox and Sudakov, for $k\ge4$ and $s\ge k+3$. In this paper, we prove that $r_4(6,n)\ge 2^{2^{cn}}$ for some absolute constant $c>0$, improving upon our previous bound. Consequently, we confirm the Erdős--Hajnal conjecture for $r_k(k+2,n)$ for all fixed $k\ge4$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.26563 — 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-08T15:16:21.702Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).