Name
Abstract | ||
|---|---|---|
We consider rooted subgraphs in random graphs, that is, extension counts such as (i) the number of triangles containing a given vertex or (ii) the number of paths of length three connecting two given vertices. In 1989, Spencer gave sufficient conditions for the event that, with high probability, these extension counts are asymptotically equal for all choices of the root vertices. For the important strictly balanced case, Spencer also raised the fundamental question as to whether these conditions are necessary. We answer this question by a careful second moment argument, and discuss some intriguing problems that remain open. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1002/rsa.21050 | RANDOM STRUCTURES & ALGORITHMS |
Keywords | DocType | Volume |
extreme values, random graph, rooted subgraphs, subgraph counts | Journal | 61 |
Issue | ISSN | Citations |
1 | 1042-9832 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Šileikis Matas | 1 | 0 | 0.34 |
| Lutz Warnke | 2 | 19 | 6.13 |