Preprint
Oct 2026
Off-diagonal Ramsey numbers of 3-graphs
We prove a conjecture of Conlon, Fox, Gunby, He, Mubayi, Suk, Verstra\"{e}te, and Yu that for a $3$-graph $H$, the off-diagonal Ramsey number $R(H,n)$ is polynomial in $n$ if and only if $H$ is isomorphic to a subgraph of the"depth-$t$ iterated blowup"$\textsf{B}_t$ for an integer $t\geq 0$. Here, the $3$-graphs $\text...
Lior Gishboliner, Sepehr Hajebi, Xiang-Yu Li
· 0 citations