All Ramsey numbers $r(K_{3},G)$ for connected graphs of order 9

  • Stephan Brandt
  • Gunnar Brinkmann
  • Thomas Harmuth
DOI: https://doi.org/10.37236/1345

Abstract

We determine the Ramsey numbers $r(K_3,G)$ for all $261080$ connected graphs of order $9$ and further Ramsey numbers of this type for some graphs of order up to $12$. Almost all of them were determined by computer programs which are based on a program for generating maximal triangle-free graphs.

Published
1998-01-03
How to Cite
Brandt, S., Brinkmann, G., & Harmuth, T. (1998). All Ramsey numbers $r(K_{3},G)$ for connected graphs of order 9 . The Electronic Journal of Combinatorics, 5(1), R7. https://doi.org/10.37236/1345
Issue
Volume 5 (1998)
Article Number
R7