Polynomial off-diagonal Ramsey number conjecture for 3-graphs
For every finite -uniform hypergraph , the off-diagonal Ramsey number is polynomially bounded in if and only if there exists an integer such that is isomorphic to a subgraph of . Here, is the least integer such that every red-blue coloring of the edges of the complete -uniform hypergraph on vertices contains either a red copy of or a blue complete -uniform hypergraph on vertices; polynomially bounded means that there exist constants such that for all . The hypergraphs are defined recursively by consisting of one vertex, and, for , is obtained from the disjoint union of three copies of by adding every transversal hyperedge with one vertex in each copy.
References
- Off-diagonal Ramsey numbers of 3-graphs — arXiv — Lior Gishboliner, Sepehr Hajebi, Xiangyu Li
Source: arXiv
Progress summary
The conjecture remains open, with substantial partial classifications but no independently verified proof of the full characterization.
The conjecture predicts exactly which -graphs have polynomial off-diagonal Ramsey growth: those contained in recursively iterated blowups of an edge. The full characterization remains unresolved in the independently assessed literature.
Known results
- Tightly connected -graphs: polynomial growth exactly for subgraphs of iterated blowups of an edge (Gishboliner, Hajebi, Li, 2024).
- -graphs with at most two tight components: the same characterization; nonexamples have quasipolynomial lower bounds (Gishboliner, Hajebi, Li, 2024).
- Some linear -graphs have superpolynomial growth, disproving the folklore claim that every linear -graph has polynomial growth (2025).
- A later preprint proves the conjecture for at most five tight components and reduces the general case to linear -graphs (2026).
October 10, 2026 partial classification
A preprint by Gishboliner, Hajebi, and Li extends the classification to -graphs with at most five tight components, proves equivalence with the linear case, and gives further results for special families including the Fano plane. These are claimed advances, not an independently verified solution of the full conjecture.
Current status (as of October 2026): Partial cases are settled, but the general polynomial off-diagonal Ramsey classification for -graphs remains open.
Sources
Solutions 0
No solutions have been posted yet.