Almost all graphs with 2. 522 edges are not 3-colorable.
Achlioptas, Dimitris, Molloy, Michael (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Coloring the edges of a random graph without a monochromatic giant component.”
Almost all graphs with 2. 522 edges are not 3-colorable.
Ramsey Properties of Random Graphs and Folkman Numbers
Vojtěch Rödl, Andrzej Ruciński, Mathias Schacht (2017)
Discussiones Mathematicae Graph Theory
Similarity:
For two graphs, G and F, and an integer r ≥ 2 we write G → (F)r if every r-coloring of the edges of G results in a monochromatic copy of F. In 1995, the first two authors established a threshold edge probability for the Ramsey property G(n, p) → (F)r, where G(n, p) is a random graph obtained by including each edge of the complete graph on n vertices, independently, with probability p. The original proof was based on the regularity lemma of Szemerédi and this led to tower-type dependencies...
Encores on cores.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Constrainted graph processes.
Bolobás, Béla, Riordan, Oliver (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On vertex, edge, and vertex-edge random graphs.
Beer, Elizabeth, Fill, James Allen, Janson, Svante, Scheinerman, Edward R. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Balanced online Ramsey games in random graphs.
Prakash, Anupam, Spöhel, Reto, Thomas, Henning (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Critical subgraphs of a random graph.
Molloy, Michael, Reed, Bruce (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Continuity of the percolation threshold in randomly grown graphs.
Turova, Tatyana S. (2007)
Electronic Journal of Probability [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:
Almost every bipartite graph has not two vertices of minimum degree
József Bukor (1993)
Mathematica Slovaca
Similarity:
Bootstrap percolation and diffusion in random graphs with given vertex degrees.
Amini, Hamed (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: