Counts of extensions, such as the number of triangles containing a vertex or the number of paths of length five containing a given two vertices, are examined in a random graph. It is shown, roughly, that when the expected value of the number grows faster than logarithmically then the counts are asympotically equal for all choices of the root points.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics