Coloring the edges of a random graph without a monochromatic giant component.
Spöhel, Reto ; Steger, Angelika ; Thomas, Henning
The Electronic Journal of Combinatorics [electronic only], Tome 17 (2010), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2010-01-01
EUDML-ID : urn:eudml:doc:226867 
@article{05799461,
     title = {Coloring the edges of a random graph without a monochromatic giant component.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {17},
     year = {2010},
     zbl = {1202.05130},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05799461}
}

Spöhel, Reto; Steger, Angelika; Thomas, Henning. Coloring the edges of a random graph without a monochromatic giant component.. The Electronic Journal of Combinatorics [electronic only], Tome 17 (2010) . http://gdmltest.u-ga.fr/item/05799461/