42 search results - page 2 / 9 » Small subgraphs of random regular graphs |
JCT
2011
13 years 1 months ago
2011
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...
RSA
2006
13 years 6 months ago
2006
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
RSA
2008
13 years 6 months ago
2008
LATIN
2000
Springer
13 years 10 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...