Computation of new diagonal graph Ramsey numbers

Richard M. Low (Department of Mathematics and Statistics, San Jose State University, San Jose, CA 95192, USA)
Ardak Kapbasov (Department of Mathematics and Statistics, San Jose State University, San Jose, CA 95192, USA)
Arman Kapbasov (Facebook, 1 Hacker Way, Menlo Park, CA 94025, USA)
Sergey Bereg (Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA)

Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 10, No 2 (2022): Electronic Journal of Graph Theory and Applications

For various connected simple graphs G, we extend the table of diagonal graph Ramsey numbers R(G, G) in ‘An Atlas of Graphs.’ This is accomplished by first converting the calculation of R(G, G) into a satisfiability problem in propositional logic. Mathematical arguments and scientific computing are then used to calculate R(G, G).