Constrainted graph processes.
Bolobás, Béla, Riordan, Oliver (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On coverings of random graphs”
Constrainted graph processes.
Coloring the edges of a random graph without a monochromatic giant component.
Spöhel, Reto, Steger, Angelika, Thomas, Henning (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Ramsey minimal graphs.
Luczak, Tomasz (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Planarity thresholds for two types of random subgraphs of the -cube
Karin Mahrhold, Karl F. E. Weber (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Multigraphs (only) satisfy a weak triangle removal lemma.
Shapira, Asaf, Yuster, Raphael (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edge cover time for regular graphs.
Tauraso, Roberto (2008)
Journal of Integer Sequences [electronic only]
Similarity:
On the norms of the random walks on planar graphs
Andrzej Żuk (1997)
Annales de l'institut Fourier
Similarity:
We consider the nearest neighbor random walk on planar graphs. For certain families of these graphs, we give explicit upper bounds on the norm of the random walk operator in terms of the minimal number of edges at each vertex. We show that for a wide range of planar graphs the spectral radius of the random walk is less than one.