The logarithmic-exponent conjecture for the Ramsey number r(4,t)
Let be the least integer such that every graph on vertices contains either a complete subgraph isomorphic to or an independent set of size . The conjecture is that, as , ; equivalently, there exist constants and such that for all , .
References
- The logarithmic exponent of the Ramsey number r(4,t) — arXiv — Qizhong Lin, Qiuyang Zhang
Source: arXiv
Progress summary
A new unrefereed preprint claims a much sharper lower bound for this Ramsey number, bringing it close to the conjectured answer, but the claim has not been independently checked.
The conjecture predicts that the off-diagonal Ramsey number has order . The latest work claims the matching lower-bound exponent, while the previously established result left a factor of unresolved.
Known results
- Mattheus and Verstraëte (2024) proved and combined this with the upper bound , establishing .
October 13, 2026 lower-bound claim
Qizhong Lin and Qiuyang Zhang state in an arXiv preprint that , improving the prior lower bound by a factor of . This is a claimed advance, not an independently verified result.
Current status (as of October 2026): the order is established, while the sharper logarithmic exponent is supported by an unrefereed lower-bound claim and remains unverified.
Solutions 0
No solutions have been posted yet.