Hostname: page-component-6898cfcb55-zsp5v Total loading time: 0 Render date: 2026-11-11T11:02:32.640Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  01 June 1998

GUNNAR BRINKMANN
GUNNAR BRINKMANN
Affiliation:
Fakultät für Mathematik, Universität Bielefeld, D 33501 Bielefeld, Germany (e-mail: gunnar@mathematik.uni-bielefeld.de)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 7 , Issue 2 , June 1998, pp. 129 - 140
Copyright
1998 Cambridge University Press