Ramsey numbers of connected clique matchings (Q510356): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C55 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05D10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6686289 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Ramsey theory | |||
Property / zbMATH Keywords: Ramsey theory / rank | |||
Normal rank |
Revision as of 03:39, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Ramsey numbers of connected clique matchings |
scientific article |
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