Erdős–Hajnal hypergraph Ramsey conjecture

For every pair of integers s>k≥4s>k\ge 4, there exists a constant c=c(s,k)>0c=c(s,k)>0 such that, for all sufficiently large integers nn, rk(s,n)≥twr⁡k−1(cn)r_k(s,n)\ge \operatorname{twr}_{k-1}(cn). Here rk(s,n)r_k(s,n) is the least integer NN such that every kk-uniform hypergraph on NN vertices contains either a complete kk-uniform hypergraph Ks(k)K_s^{(k)} or an independent set of size nn, and twr⁡1(x)=2x\operatorname{twr}_1(x)=2^x and twr⁡j+1(x)=2twr⁡j(x)\operatorname{twr}_{j+1}(x)=2^{\operatorname{twr}_j(x)}.

References

Primary source

arXiv

Additional references

Progress summary

Refreshed
Claimed progress

A September 2026 paper claims a major lower-bound advance for one family of hypergraph Ramsey numbers, but the full conjecture remains open.

The Erdős–Hajnal conjecture concerns tower-type lower bounds for off-diagonal hypergraph Ramsey numbers. The latest claim establishes the target family r4(6,n)r_4(6,n) and, by stepping up, the corresponding rk(k+2,n)r_k(k+2,n) consequence for every fixed k≥4k \ge 4.

Known results

  • The 2016 treatment obtained tower bounds in many parameter ranges but left the k+2k+2 cases, including r4(6,n)r_4(6,n), unresolved: r4(6,n)≥22Ω(n1/2)r_4(6,n) \ge 2^{2^{\Omega(n^{1/2})}} was not reached.
  • A 2020 paper settled nearby families such as rk(k+1,k−1;n)=twr⁡k−2(nΘ(1))r_k(k+1,k-1;n)=\operatorname{twr}_{k-2}(n^{\Theta(1)}), while leaving the relevant remaining cases open.

September 2026 claimed bound

A September 22, 2026 report attributes to Longma Du, Xinyu Hu, Ruilong Liu, and Guanghui Wang the bound r4(6,n)≥22cnr_4(6,n) \ge 2^{2^{cn}}, with the fixed-kk consequence for rk(k+2,n)r_k(k+2,n), k≥4k \ge 4. This is substantial claimed progress, not a verified resolution of the broader conjecture.

Current status (as of September 2026): the r4(6,n)r_4(6,n) bound and its fixed-kk rk(k+2,n)r_k(k+2,n) consequence are claimed but unverified; the full Erdős–Hajnal conjecture remains open.

Sources

Solutions 0

No solutions have been posted yet.