On Ramsey numbers for large disjoint unions of graphs
type: Item
instance of: scholarly article
title: On Ramsey numbers for large disjoint unions of graphs
zbMATH Open document ID: 0647.05040
DOI: 10.1016/0012-365X(88)90004-0
author: Stefan A. Burr
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: Let \({\mathcal G}\) denote a fixed finite set of connected graphs. This paper contains results which, in principle, enable one to evaluate the Ramsey number r(G,H) when G and H are sufficiently large disjoint unions of graphs taken from \({\mathcal G}\). Using this result the author computes: \[ r(mK_ k,nK_ h)=(k-1)m+hn+r(K_{k-1},K_{h-1})-2 \] when m and n are sufficiently large with \(m\leq n\).
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 4055656
zbMATH Keywords: Ramsey number
reviewed by: Jack E. Graver
MaRDI profile type: Publication
cites work: Ramsey Theorems for Multiple Copies of Graphs
cites work: On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
cites work: Parallel concepts in graph theory
cites work: Q4044602
cites work: Q4065548
description: scientific article; zbMATH DE number 4055656