Ramsey numbers of connected clique matchings
Roberts, B.
(2017).
Ramsey numbers of connected clique matchings.
Electronic Journal of Combinatorics,
24(1), P1.36.
We determine the Ramsey number of a connected clique matching. That is, we show that if GG is a 22-edge-coloured complete graph on (r2−r−1)n−r+1(r2−r−1)n−r+1 vertices, then there is a monochromatic connected subgraph containing nn disjoint copies of KrKr, and that this number of vertices cannot be reduced.
| Item Type | Article |
|---|---|
| Copyright holders | © 2017 The Author |
| Departments | LSE > Academic Departments > Mathematics |
| Date Deposited | 17 Mar 2017 |
| Acceptance Date | 04 Feb 2017 |
| URI | https://researchonline.lse.ac.uk/id/eprint/69860 |
Explore Further
- http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p36/0 (Publisher)
- https://www.scopus.com/pages/publications/85013399111 (Scopus publication)
- http://www.combinatorics.org/ojs/index.php/eljc/in... (Official URL)