A note on the non-colorability threshold of a random graph.
Kaporis, Alexis C., Kirousis, Lefteris M., Stamatiou, Yannis C. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The -stability number of a random graph.”
A note on the non-colorability threshold of a random graph.
Finding induced acyclic subgraphs in random digraphs.
Subramanian, C.R. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Random subgraphs of certain graph powers.
Clark, Lane (2002)
International Journal of Mathematics and Mathematical Sciences
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:
A note on odd cycle-complete graph Ramsey numbers.
Sudakov, Benny (2002)
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:
The spectral gap of random graphs with given expected degrees.
Coja-Oghlan, Amin, Lanka, André (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphs with many copies of a given subgraph.
Nikiforov, Vladimir (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on quenched moderate deviations for Sinai’s random walk in random environment
Francis Comets, Serguei Popov (2004)
ESAIM: Probability and Statistics
Similarity:
We consider the continuous time, one-dimensional random walk in random environment in Sinai’s regime. We show that the probability for the particle to be, at time and in a typical environment, at a distance larger than () from its initial position, is .
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:
Almost all graphs with 2. 522 edges are not 3-colorable.
Achlioptas, Dimitris, Molloy, Michael (1999)
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:
Degree constrained orientations in countable graphs.
Bernáth, Attila, Bruhn, Henning (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: