All Ramsey numbers $r(K_{3},G)$ for connected graphs of order 9
-
Published:1998-01-03
Issue:1
Volume:5
Page:
-
ISSN:1077-8926
-
Container-title:The Electronic Journal of Combinatorics
-
language:
-
Short-container-title:Electron. J. Combin.
Author:
Brandt Stephan,Brinkmann Gunnar,Harmuth Thomas
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.
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
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献