|
СЕМИНАРЫ |
Большой семинар лаборатории комбинаторных и геометрических структур
|
|||
|
Counting extensions in random graphs L. Warnke |
|||
Аннотация: We consider rooted subgraphs in random graphs, i.e., extension counts such as (a) the number of triangles containing a given ‘root’ vertex, or (b) the number of paths of length three connecting two given ‘root’ vertices. In 1989 Spencer gave sufficient conditions for the event that, whp, all roots of the binomial random graph G(n,p) have the same asymptotic number of extensions, i.e., Based on joint work with Matas Sileikis. |