Sciweavers

42 search results - page 1 / 9
» Small subgraphs of random regular graphs
Sort
View
DM
2007
93views more  DM 2007»
13 years 4 months ago
Small subgraphs of random regular graphs
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
Jeong Han Kim, Benny Sudakov, Van H. Vu
EJC
2006
13 years 4 months ago
3-star factors in random d-regular graphs
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
Hilda Assiyatun, Nicholas C. Wormald
RSA
2011
77views more  RSA 2011»
12 years 11 months ago
Regular induced subgraphs of a random Graph
An old problem of Erd˝os, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem...
Michael Krivelevich, Benny Sudakov, Nicholas C. Wo...
JCT
2008
70views more  JCT 2008»
13 years 4 months ago
The number of possibilities for random dating
Let G be a regular graph and H a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of H one expects to find in a random subgraph of G...
Aaron Abrams, Rod Canfield, Andrew Granville
RSA
2006
80views more  RSA 2006»
13 years 4 months ago
Regular subgraphs of random graphs
In this paper, we prove that there exists a function k = (4 + o(1))k such that G(n, /n) contains a k-regular graph with high probability whenever > k. In the case of k = 3, it...
Béla Bollobás, Jeong Han Kim, Jacque...