Ramsey numbers of connected clique matchings (Q510356)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6686289
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ramsey numbers of connected clique matchings |
scientific article; zbMATH DE number 6686289 |
Statements
Ramsey numbers of connected clique matchings (English)
0 references
17 February 2017
0 references
Summary: We determine the Ramsey number of a connected clique matching. That is, we show that if \(G\) is a 2-edge-coloured complete graph on \((r^2-r-1)n-r+1\) vertices, then there is a monochromatic connected subgraph containing \(n\) disjoint copies of \(K_r\), and that this number of vertices cannot be reduced.
0 references
Ramsey theory
0 references
0.8498621582984924
0 references
0.8472344279289246
0 references
0.8246938586235046
0 references
0.820385754108429
0 references
