Geodesic
A note on the rainbow connection of random regular graphs
The electronic journal of combinatorics, Tome 24 (2017) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove that a random 3-regular graph has rainbow connection number $O(\log n)$. This completes the remaining open case from Rainbow connection of random regular graphs, by Dudek, Frieze and Tsourakakis.
DOI : 10.37236/6789
Classification : 05C80, 05C15
Mots-clés : random regular graphs 
@article{10_37236_6789,
     author = {Michael Molloy},
     title = {A note on the rainbow connection of random regular graphs},
     journal = {The electronic journal of combinatorics},
     year = {2017},
     volume = {24},
     number = {3},
     doi = {10.37236/6789},
     zbl = {1369.05185},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6789/}
}
TY  - JOUR
AU  - Michael Molloy
TI  - A note on the rainbow connection of random regular graphs
JO  - The electronic journal of combinatorics
PY  - 2017
VL  - 24
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6789/
DO  - 10.37236/6789
ID  - 10_37236_6789
ER  - 
%0 Journal Article
%A Michael Molloy
%T A note on the rainbow connection of random regular graphs
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/6789/
%R 10.37236/6789
%F 10_37236_6789
Michael Molloy. A note on the rainbow connection of random regular graphs. The electronic journal of combinatorics, Tome 24 (2017) no. 3. doi: 10.37236/6789

Cité par Sources :