Sciweavers

137 search results - page 4 / 28
» Critical Subgraphs of a Random Graph
Sort
View
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 8 months ago
Finding Dense Subgraphs in G(n,1/2)
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
Atish Das Sarma, Amit Deshpande, Ravi Kannan
JCT
2011
90views more  JCT 2011»
13 years 3 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
COMBINATORICA
2006
42views more  COMBINATORICA 2006»
13 years 8 months ago
Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube
Christian Borgs, Jennifer T. Chayes, Remco van der...
DM
2002
78views more  DM 2002»
13 years 8 months ago
Hamilton cycles in random subgraphs of pseudo-random graphs
Alan M. Frieze, Michael Krivelevich
RSA
2008
70views more  RSA 2008»
13 years 8 months ago
Distribution of subgraphs of random regular graphs
Zhicheng Gao, Nicholas C. Wormald