Login / Signup

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

Reto SpöhelAngelika StegerHenning Thomas
Published in: Electron. Notes Discret. Math. (2009)
Keyphrases
  • random graphs
  • undirected graph
  • graph theoretic
  • connected components
  • directed graph
  • lower bound
  • complex networks
  • phase transition
  • directed acyclic graph