← All problems

Polynomial off-diagonal Ramsey number conjecture for 3-graphs

For every finite 33-uniform hypergraph HH, the off-diagonal Ramsey number R(H,n)R(H,n) is polynomially bounded in nn if and only if there exists an integer t≥0t\ge 0 such that HH is isomorphic to a subgraph of Bt\textsf{B}_t. Here, R(H,n)R(H,n) is the least integer NN such that every red-blue coloring of the edges of the complete 33-uniform hypergraph on NN vertices contains either a red copy of HH or a blue complete 33-uniform hypergraph on nn vertices; polynomially bounded means that there exist constants C,d>0C,d>0 such that R(H,n)≤CndR(H,n)\le Cn^d for all nn. The hypergraphs Bt\textsf{B}_t are defined recursively by B0\textsf{B}_0 consisting of one vertex, and, for t≥1t\ge 1, Bt\textsf{B}_t is obtained from the disjoint union of three copies of Bt−1\textsf{B}_{t-1} by adding every transversal hyperedge with one vertex in each copy.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

The conjecture remains open, with substantial partial classifications but no independently verified proof of the full characterization.

The conjecture predicts exactly which 33-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 33-graphs: polynomial growth exactly for subgraphs of iterated blowups of an edge (Gishboliner, Hajebi, Li, 2024).
  • 33-graphs with at most two tight components: the same characterization; nonexamples have quasipolynomial lower bounds (Gishboliner, Hajebi, Li, 2024).
  • Some linear 33-graphs have superpolynomial growth, disproving the folklore claim that every linear 33-graph has polynomial growth (2025).
  • A later preprint proves the conjecture for at most five tight components and reduces the general case to linear 33-graphs (2026).

October 10, 2026 partial classification

A preprint by Gishboliner, Hajebi, and Li extends the classification to 33-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 33-graphs remains open.

Sources

Solutions 0

No solutions have been posted yet.