Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-23T11:03:50.299Z 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: [email protected])
Get access Rights & Permissions [Opens in a new window]

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.

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)