Finding induced acyclic subgraphs in random digraphs.
Subramanian, C.R. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A note on the non-colorability threshold of a random graph.”
Finding induced acyclic subgraphs in random digraphs.
Random subgraphs of certain graph powers.
Clark, Lane (2002)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The -stability number of a random graph.
Fountoulakis, Nikolaos, Kang, Ross J., McDiarmid, Colin (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Almost all graphs with 2. 522 edges are not 3-colorable.
Achlioptas, Dimitris, Molloy, Michael (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on odd cycle-complete graph Ramsey numbers.
Sudakov, Benny (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Random -sat: the limiting probability for satisfiability for moderately growing .
Coja-Oghlan, Amin, Frieze, Alan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Holes in graphs.
Peng, Yuejian, Rödl, Vojtech, Ruciński, Andrzej (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Survival time of random walk in random environment among soft obstacles.
Gantert, Nina, Popov, Serguei, Vachkovskaia, Marina (2009)
Electronic Journal of Probability [electronic only]
Similarity:
Graphs with many copies of a given subgraph.
Nikiforov, Vladimir (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ramdom variables related to distributions of sums modulo an integer.
Sburlati, G. (2002)
Rendiconti del Seminario Matematico
Similarity:
On rainbow trees and cycles.
Frieze, Alan, Krivelevich, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sparse graphs usually have exponentially many optimal colorings.
Krivelevich, Michael (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Component evolution in random intersection graphs.
Behrisch, Michael (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity: