Abstract
The lower bound for the classical Ramsey number $R(4,6)$ is improved from 35 to 36. The author has found 37 new edge colorings of $K_{35}$ that have no complete graphs of order 4 in the first color, and no complete graphs of order 6 in the second color. The most symmetric of the colorings has an automorphism group of order 4, with one fixed point, and is presented in detail. The colorings were found using a heuristic search procedure.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. New bounds for Ramsey numbers R(Kk−e,Kl−e);Discrete Applied Mathematics;2022-01
2. Ramsey sequences of graphs;AKCE International Journal of Graphs and Combinatorics;2020-05-03
3. Graph classes and Ramsey numbers;Discrete Applied Mathematics;2014-08
4. SCSat: A Soft Constraint Guided SAT Solver;Theory and Applications of Satisfiability Testing – SAT 2013;2013