← All problems

The logarithmic-exponent conjecture for the Ramsey number r(4,t)

Let r(4,t)r(4,t) be the least integer nn such that every graph on nn vertices contains either a complete subgraph isomorphic to K4K_4 or an independent set of size tt. The conjecture is that, as t→∞t\to\infty, r(4,t)=Θ ⁣(t3(log⁡t)2)r(4,t)=\Theta\!\left(\frac{t^3}{(\log t)^2}\right); equivalently, there exist constants c,C>0c,C>0 and t0t_0 such that for all t≥t0t\ge t_0, ct3(log⁡t)2≤r(4,t)≤Ct3(log⁡t)2c\frac{t^3}{(\log t)^2}\le r(4,t)\le C\frac{t^3}{(\log t)^2}.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

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 t3/(log⁡t)2t^3/(\log t)^2. The latest work claims the matching lower-bound exponent, while the previously established result left a factor of (log⁡t)2(\log t)^2 unresolved.

Known results

  • Mattheus and Verstraëte (2024) proved r(4,t)=Ω(t3/log⁡4t)r(4,t)=\Omega(t^3/\log^4 t) and combined this with the upper bound r(4,t)=O(t3/log⁡2t)r(4,t)=O(t^3/\log^2 t), establishing r(4,t)=t3+o(1)r(4,t)=t^{3+o(1)}.

October 13, 2026 lower-bound claim

Qizhong Lin and Qiuyang Zhang state in an arXiv preprint that r(4,t)≥t3/(log⁡t)2+o(1)r(4,t)\ge t^3/(\log t)^{2+o(1)}, improving the prior lower bound by a factor of (log⁡t)2−o(1)(\log t)^{2-o(1)}. This is a claimed advance, not an independently verified result.

Current status (as of October 2026): the order t3+o(1)t^{3+o(1)} is established, while the sharper logarithmic exponent 22 is supported by an unrefereed lower-bound claim and remains unverified.

Sources

Solutions 0

No solutions have been posted yet.