Ramsey Numbers for $1$-Degenerate $3$-Graphs
The Electronic Journal of Combinatorics · 2026-06-19 · 33 (2)
DOI: 10.37236/14437 ↗At a glance
Journal article in The Electronic Journal of Combinatorics, published online on 2026-06-19. Written by Peter Allen and 2 co-authors.
Abstract (original language)
We construct a $3$-uniform $1$-degenerate hypergraph on $n$ vertices whose $2$-colour Ramsey number is $\Omega\big(n^{3/2}/\log n\big)$. This shows that all remaining open cases of the hypergraph Burr-Erdős conjecture are false. Our graph is a variant of the celebrated hedgehog graph. We additionally show near-sharp upper bounds, proving that all $3$-uniform generalised hedgehogs have $2$-colour Ramsey number $O\big(n^{3/2}\big)$.
Cite
APA
Allen, P., Boyadzhiyska, S., & Pavez-Signé, M. (2026). Ramsey Numbers for $1$-Degenerate $3$-Graphs. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14437
Vancouver
Allen P, Boyadzhiyska S, Pavez-Signé M. Ramsey Numbers for $1$-Degenerate $3$-Graphs. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14437
BibTeX
@article{Allen2026,
author = {Allen, Peter and Boyadzhiyska, Simona and Pavez-Signé, Matías},
title = {Ramsey Numbers for $1$-Degenerate $3$-Graphs},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {2},
doi = {10.37236/14437}
}
EUVIMED