Name
Abstract | ||
|---|---|---|
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 used to study the almost sure existence of, and the asymptotic distribution of, regular spanning subgraphs of various types in random d-regular graphs and hypergraphs. In this paper, we use the method to prove the almost sure existence of 3-star factors in random d-regular graphs. This is essentially the first application of the method to nonregular subgraphs in such graphs. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.ejc.2006.05.003 | Eur. J. Comb. |
Keywords | Field | DocType |
sure hamiltonicity,3-star factor,sure existence,various type,small subgraph conditioning method,asymptotic distribution,random d-regular graph,regular graph | Graph,Random regular graph,Discrete mathematics,Indifference graph,Combinatorics,Random graph,Constraint graph,Chordal graph,Pathwidth,Mathematics,Asymptotic distribution | Journal |
Volume | Issue | ISSN |
27 | 8 | 0195-6698 |
Citations | PageRank | References |
3 | 0.44 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hilda Assiyatun | 1 | 16 | 5.91 |
| Nicholas C. Wormald | 2 | 1506 | 230.43 |