Lower bounds for Ramsey numbers of bounded degree hypergraphs
Journal of Combinatorial Theory, Series B · 2026-07 · 179 · 250-269
DOI: 10.1016/j.jctb.2026.04.002 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Theory, Series B, 2026-07. Verfasst von Domagoj Bradač und 2 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Swiss National Science Foundation.
Abstract (Originalsprache)
We prove that, for all $k \ge 3,$ and any integers $\Delta, n$ with $n \ge \Delta,$ there exists a $k$-uniform hypergraph on $n$ vertices with maximum degree at most $\Delta$ whose $4$-color Ramsey number is at least $\mathrm{tw}_k(c_k \Delta) \cdot n$, for some constant $c_k>0$, where $\mathrm{tw}_k$ denotes the tower function. For $k \ge 4,$ this is tight up to the constant $c_k$ and for $k = 3$ it is known to be tight up to a factor of $\log \Delta$ on top of the tower. It extends a well-known result of Graham, R\"{o}dl and Ruci\'{n}ski for graphs and answers a question of Conlon, Fox and Sudakov from 2008.
Förderung
- Swiss National Science Foundation
Zitieren
APA
Bradač, D., Hunter, Z., & Sudakov, B. (2026). Lower bounds for Ramsey numbers of bounded degree hypergraphs. Journal of Combinatorial Theory, Series B, 179, 250-269. https://doi.org/10.1016/j.jctb.2026.04.002
Vancouver
Bradač D, Hunter Z, Sudakov B. Lower bounds for Ramsey numbers of bounded degree hypergraphs. Journal of Combinatorial Theory, Series B. 2026;179:250-269. doi:10.1016/j.jctb.2026.04.002
BibTeX
@article{Brada2026,
author = {Bradač, Domagoj and Hunter, Zach and Sudakov, Benny},
title = {Lower bounds for Ramsey numbers of bounded degree hypergraphs},
journal = {Journal of Combinatorial Theory, Series B},
year = {2026},
volume = {179},
pages = {250--269},
doi = {10.1016/j.jctb.2026.04.002}
}
EUVIMED