Geodesic
Ramsey numbers of connected clique matchings
Barnaby Roberts1
1London School of Economics
The electronic journal of combinatorics, Tome 24 (2017) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/6284
Classification : 05C55, 05D10
Mots-clés : Ramsey theory

Barnaby Roberts  1

1 London School of Economics 
@article{10_37236_6284,
     author = {Barnaby Roberts},
     title = {Ramsey numbers of connected clique matchings},
     journal = {The electronic journal of combinatorics},
     year = {2017},
     volume = {24},
     number = {1},
     doi = {10.37236/6284},
     zbl = {1355.05166},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6284/}
}
TY  - JOUR
AU  - Barnaby Roberts
TI  - Ramsey numbers of connected clique matchings
JO  - The electronic journal of combinatorics
PY  - 2017
VL  - 24
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6284/
DO  - 10.37236/6284
ID  - 10_37236_6284
ER  - 
%0 Journal Article
%A Barnaby Roberts
%T Ramsey numbers of connected clique matchings
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/6284/
%R 10.37236/6284
%F 10_37236_6284
Barnaby Roberts. Ramsey numbers of connected clique matchings. The electronic journal of combinatorics, Tome 24 (2017) no. 1. doi: 10.37236/6284

Cité par Sources :