All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8

Authors:
Gunnar Brinkmann
Affiliations:
Fakultät für Mathematik, Universität Bielefeld, D 33501 Bielefeld, Germany (e-mail: gunnar@mathematik.uni-bielefeld.de)
Venue:
Combinatorics, Probability and Computing
Year:
1998

Citing 5
Cited 0

The value of the Ramsey number R(3,8)

Journal of Graph Theory
R(4,5)=25

Journal of Graph Theory
Ramsey numbers r(K3, G) for connected graphs G of order seven

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Isomorph-free exhaustive generation

Journal of Algorithms
Graphs and Hypergraphs

Graphs and Hypergraphs

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we will give all Ramsey numbers r(K3, G) for connected graphs G of order 7 and 8. For smaller orders and non-connected graphs of order up to 8, the number of graphs with given Ramsey number is listed for all possible values.