Geodesic
Note on highly connected monochromatic subgraphs in 2-colored complete graphs
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this note, we improve upon some recent results concerning the existence of large monochromatic, highly connected subgraphs in a $2$-coloring of a complete graph. In particular, we show that if $n\ge 6.5(k - 1)$, then in any $2$-coloring of the edges of $K_{n}$, there exists a monochromatic $k$-connected subgraph of order at least $n - 2(k - 1)$. Our result improves upon several recent results by a variety of authors.
DOI : 10.37236/502
Classification : 05C15, 05C40
Mots-clés : large monochromatic subgraphs, highly connected subgraphs 
@article{10_37236_502,
     author = {Shinya Fujita and Colton Magnant},
     title = {Note on highly connected monochromatic subgraphs in 2-colored complete graphs},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/502},
     zbl = {1205.05090},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/502/}
}
TY  - JOUR
AU  - Shinya Fujita
AU  - Colton Magnant
TI  - Note on highly connected monochromatic subgraphs in 2-colored complete graphs
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/502/
DO  - 10.37236/502
ID  - 10_37236_502
ER  - 
%0 Journal Article
%A Shinya Fujita
%A Colton Magnant
%T Note on highly connected monochromatic subgraphs in 2-colored complete graphs
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/502/
%R 10.37236/502
%F 10_37236_502
Shinya Fujita; Colton Magnant. Note on highly connected monochromatic subgraphs in 2-colored complete graphs. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/502

Cité par Sources :