Paperlane

no. 16 · Tuesday 17 November 2026

Off-diagonal hypergraph Ramsey numbers

Lior Gishboliner, Sepehr Hajebi and Xiangyu Li

math.CO · v2

Abstract

For $n,r\in\mathbb{N}$ with $r\geq 3$ and an $r$-graph (i.e., an $r$-uniform hypergraph) $H$, the Ramsey number $R(H,n)$ is the smallest $N\in\mathbb{N}$ such that every red/blue coloring of the hyperedges of the $N$-vertex complete $r$-graph $K_N^{(r)}$ contains either a red copy of $H$ or a blue copy of $K_n^{(r)}$. For every integer $r\geq 3$, we characterize all $r$-graphs $H$ for which $R(H,n)$ is polynomial in $n$. Explicitly, we prove a conjecture of Conlon, Fox, Gunby, He, Mubayi, Suk, Verstraëte, and Yu, that $R(H,n)$ is polynomial in $n$ if and only if $H$ is isomorphic to a subgraph of a lexicographic power of $K_r^{(r)}$. This concludes an extensive line of work initiated by Erdős and Hajnal in 1972 on characterizing the polynomial growth of off-diagonal hypergraph Ramsey numbers.

fields
Combinatorics
pdf ↗ page arXiv:2610.32644 ↗