Ramsey Numbers of Connected Clique Matchings
Abstract
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 (r2 - r - 1)n - r + 1 vertices, then there is a monochromatic connected subgraph containing n disjoint copies of Kr, and that this number of vertices cannot be reduced.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.