A New Lower Bound for the Ramsey Number R(4, 8)
Abstract
The lower bound for the classical Ramsey number R(4, 8) is improved from 56 to 58. The author has found a new edge coloring of K57 that has no complete graphs of order 4 in the first color, and no complete graphs of order 8 in the second color. The coloring was found using a SAT solver which is based on MiniSat and customized for solving Ramsey problems.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.