Ramsey numbers R(K3,G) for graphs of order 10

TL;DR

This paper computes the generalized triangle Ramsey numbers for nearly all graphs of order 10 using a combination of computational and theoretical methods, providing a comprehensive table of these numbers.

Contribution

It introduces an optimized algorithm for generating maximal triangle-free graphs and computes most triangle Ramsey numbers for graphs of order 10, advancing the understanding of these numbers.

Findings

Computed 12,005,158 of 12,005,168 Ramsey numbers for graphs of order 10

Developed an efficient algorithm for generating triangle-free graphs

Proved theoretical results for Ramsey numbers exceeding 30

Abstract

In this article we give the generalized triangle Ramsey numbers R(K3,G) of 12 005 158 of the 12 005 168 graphs of order 10. There are 10 graphs remaining for which we could not determine the Ramsey number. Most likely these graphs need approaches focusing on each individual graph in order to determine their triangle Ramsey number. The results were obtained by combining new computational and theoretical results. We also describe an optimized algorithm for the generation of all maximal triangle-free graphs and triangle Ramsey graphs. All Ramsey numbers up to 30 were computed by our implementation of this algorithm. We also prove some theoretical results that are applied to determine several triangle Ramsey numbers larger than 30. As not only the number of graphs is increasing very fast, but also the difficulty to determine Ramsey numbers, we consider it very likely that the table of all triangle Ramsey numbers for graphs of order 10 is the last complete table that can possibly be determined for a very long time.