Advanced search
1 file | 255.88 KB

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

Author
Organization
Project
HPC-UGent: the central High Performance Computing infrastructure of Ghent University
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.
Keywords
generation, Ramsey number, triangle-free graph, CONNECTED GRAPHS, GENERATION, R(K-3, G)

Downloads

  • 2548-4905-1-PB.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 255.88 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Brinkmann, Gunnar, Jan Goedgebeur, and Jan-Christoph Schlage-Puchta. 2012. “Ramsey Numbers R(K3, G) for Graphs of Order 10.” Electronic Journal of Combinatorics 19 (4).
APA
Brinkmann, Gunnar, Goedgebeur, J., & Schlage-Puchta, J.-C. (2012). Ramsey numbers R(K3, G) for graphs of order 10. ELECTRONIC JOURNAL OF COMBINATORICS, 19(4).
Vancouver
1.
Brinkmann G, Goedgebeur J, Schlage-Puchta J-C. Ramsey numbers R(K3, G) for graphs of order 10. ELECTRONIC JOURNAL OF COMBINATORICS. 2012;19(4).
MLA
Brinkmann, Gunnar, Jan Goedgebeur, and Jan-Christoph Schlage-Puchta. “Ramsey Numbers R(K3, G) for Graphs of Order 10.” ELECTRONIC JOURNAL OF COMBINATORICS 19.4 (2012): n. pag. Print.
@article{3131479,
  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.},
  articleno    = {P36},
  author       = {Brinkmann, Gunnar and Goedgebeur, Jan and Schlage-Puchta, Jan-Christoph},
  issn         = {1077-8926},
  journal      = {ELECTRONIC JOURNAL OF COMBINATORICS},
  keyword      = {generation,Ramsey number,triangle-free graph,CONNECTED GRAPHS,GENERATION,R(K-3,G)},
  language     = {eng},
  number       = {4},
  pages        = {23},
  title        = {Ramsey numbers R(K3, G) for graphs of order 10},
  volume       = {19},
  year         = {2012},
}

Web of Science
Times cited: