Coloring the edges of a random graph without a monochromatic giant component
From MaRDI portal
Publication:5891230
DOI10.1016/j.endm.2009.07.104zbMath1273.05206MaRDI QIDQ5891230
Henning Thomas, Reto Spöhel, Angelika Steger
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.104
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Birth control for giants
- Avoiding a giant component
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- Threshold Functions for Ramsey Properties
- Creating a Giant Component
- A phase transition for avoiding a giant component
- Embracing the giant component