CFG+Y characterization of polynomial 3-uniform Ramsey growth

Let HH be a 33-uniform hypergraph, let Kn3K_n^3 be the complete 33-uniform hypergraph on nn vertices, and let r(H,Kn3)r(H,K_n^3) be the corresponding Ramsey number. Call HH iterated tripartite if it belongs to the iterated-tripartite class described in the source. CFG+Y conjecture. For any 33-graph HH, there is a constant cc such that

r(H,Kn3)ncr(H,K_n^3)\leq n^c

for all nn if and only if HH is iterated tripartite. The source describes this as an adjacent open problem and as a strengthening of the paper's main theorem.

Sources & referencesView supporting material

Primary source

Ruben Ascoli, Xiaoyu He and Hung-Hsun Hans Yu, “Polynomial-to-exponential transition in 3-uniform Ramsey numbers”, arXiv:2507.09434 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.