Erdős–Hajnal hypergraph Ramsey conjecture
For every pair of integers , there exists a constant such that, for all sufficiently large integers , . Here is the least integer such that every -uniform hypergraph on vertices contains either a complete -uniform hypergraph or an independent set of size , and and .
References
Primary source
Additional references
- The Erdős--Hajnal hypergraph Ramsey problem for r_4(6,n) — arXiv — Longma Du, Xinyu Hu, Ruilong Liu, Guanghui Wang
Progress summary
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 and, by stepping up, the corresponding consequence for every fixed .
Known results
- The 2016 treatment obtained tower bounds in many parameter ranges but left the cases, including , unresolved: was not reached.
- A 2020 paper settled nearby families such as , 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 , with the fixed- consequence for , . This is substantial claimed progress, not a verified resolution of the broader conjecture.
Current status (as of September 2026): the bound and its fixed- consequence are claimed but unverified; the full Erdős–Hajnal conjecture remains open.
Solutions 0
No solutions have been posted yet.