Name
Abstract | ||
|---|---|---|
Let G
n,d
be a random d-regular graph with n vertices, where d = o(n). Given a fixed graph H, Y
H
denotes the number of induced copies of H in G
n,d
. In this paper, the authors determine the threshold of the event “Y
H
> 0”, and also obtain the induced subgraph counts inside the threshold interval. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s11424-008-9141-7 | J. Systems Science & Complexity |
Keywords | Field | DocType |
poisson distribution,regular graph | Random regular graph,Discrete mathematics,Combinatorics,Graph power,Graph factorization,Induced subgraph isomorphism problem,Induced subgraph,Distance-hereditary graph,Factor-critical graph,Universal graph,Mathematics | Journal |
Volume | Issue | ISSN |
21 | 4 | 15597067 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lan Xiao | 1 | 0 | 0.34 |
| Guiying Yan | 2 | 196 | 22.92 |
| Yuwen Wu | 3 | 0 | 0.34 |
| Wei Ren | 4 | 1 | 0.71 |