Coloring the edges of a random graph without a monochromatic giant component

zbMath1202.05130MaRDI QIDQ5917953

Reto Spöhel, Angelika Steger, Henning Thomas

Publication date: 13 October 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/226867

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On some Multicolor Ramsey Properties of Random Graphs ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ Partitioning random graphs into monochromatic components

This page was built for publication: Coloring the edges of a random graph without a monochromatic giant component