← All problems

Nearly diagonal book Ramsey conjecture

For every integer n≥2n\ge 2, the book Ramsey number satisfies R(Bn−1,Bn)=4n−1R(B_{n-1},B_n)=4n-1, where Bk=K2∨Kk‾B_k=K_2\vee\overline{K_k} is the graph consisting of kk triangles sharing a common edge.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

New constructions settle infinitely many additional cases, but the conjectured formula is not known for every parameter.

The conjecture asks whether the Rousseau–Sheehan upper bound R(Bn−1,Bn)≤4n−1R(B_{n-1},B_n)\le 4n-1 is always attained. The general equality remains open.

Known results

  • Rousseau–Sheehan (1978): R(Bn−1,Bn)≤4n−1R(B_{n-1},B_n)\le 4n-1.
  • Equality is known for an infinite family of nn and for every n≤21n\le 21.

2026 infinite-family constructions

Stephen Chung and William J. Wesley report explicit constructions attaining the upper bound for several infinite parameter families, yielding new exact Ramsey numbers. The preprint reports assistance from Station, but this advance and its full scope remain unverified.

Current status (as of October 2026): Equality is established for infinitely many nn and all n≤21n\le 21, with further infinite families claimed in 2026; the all-nn equality remains open.

Sources

Solutions 0

No solutions have been posted yet.