2024/11/21 by Conlon, David, Fox, Jacob, Gunby, Benjamin +5 · 2 citations
#05D10 (Primary) #05D40 (Secondary) #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2411.13812
A natural open problem in Ramsey theory is to determine those 3-graphs H for which the off-diagonal Ramsey number r(H, Kn(3)) grows polynomially with n. We make substantial progress on this question by showing that if H is tightly connected or has at most two tight components, then r(H, Kn(3)) grows polynomially if and only if H is contained in an iterated blowup of an edge.