Cookies?
Library Header Image
LSE Research Online LSE Library Services

Ramsey numbers of connected clique matchings

Roberts, Barnaby (2017) Ramsey numbers of connected clique matchings. Electronic Journal of Combinatorics, 24 (1). P1.36. ISSN 1077-8926

[img]
Preview
PDF - Published Version
Download (331kB) | Preview

Abstract

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
Official URL: http://www.combinatorics.org/ojs/index.php/eljc/in...
Additional Information: © 2017 The Author
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Sets: Departments > Mathematics
Date Deposited: 17 Mar 2017 16:19
Last Modified: 30 Jan 2019 20:45
URI: http://eprints.lse.ac.uk/id/eprint/69860

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics