On Ramsey numbers for large disjoint unions of graphs (Q1104338)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1104338 |
scientific article; zbMATH DE number 4055656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Ramsey numbers for large disjoint unions of graphs |
scientific article; zbMATH DE number 4055656 |
Statements
On Ramsey numbers for large disjoint unions of graphs (English)
0 references
1988
0 references
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\).
0 references
Ramsey number
0 references
0.8858606815338135
0 references
0.8641690611839294
0 references
0.8532325029373169
0 references
0.8526593446731567
0 references
0.8447147607803345
0 references
