Ramsey number $R(4, 20) \ge 252$

Charlie Yu

Abstract

We exhibit two explicit circulant graphs of prime order $251$ that are $K_4$-free and have independence number $19$. Consequently \[R(4,20)\ge 252.\] These improve the bound $R(4,20)\ge 237$ given by Nagda, Raghavan, Thakurta and the long standing bound $R(4,21)\ge 242$ recorded in Radziszowski's dynamic survey. The graphs are $32$-subsets of a pair of undirected quintic cyclotomic classes modulo $251$, in analogy with the quartic-residue circulant of order $313$ used for $R(4,22)$. Clique-freeness is elementary; the independence-number claims are certified by a bitset branch-and-bound on the $186$-vertex residual of a vertex.

Disclosure

“Acknowledgements The author acknowledges the use of Grok 4.6 (xAI) for assistance with literature search, verification of computational claims, drafting of expository passages, and preparation of the LATEX source. All mathematical content, constructions, and certificates were verified independently”

PDF page 4
Classification
Drafting limited passages
Multiplier
5
Verified

Structural counts

Pages 4 pdf
Theorems 1 source
Lemmas 0 source
Propositions 0 source
Corollaries 0 source
Definitions 0 source
Displayed equations 8 source
Bibliography entries 7 source
Appendix pages 0 estimated

Count notes

  • Source counts use the expanded primary TeX file r420.tex.
  • Appendix pages include the first PDF page with an explicit Appendix heading through the final page.