### Abstract

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.

Original language | English (US) |
---|---|

Pages (from-to) | 247-255 |

Number of pages | 9 |

Journal | Journal of Combinatorial Theory, Series A |

Volume | 55 |

Issue number | 2 |

DOIs | |

State | Published - 1990 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Journal of Combinatorial Theory, Series A*,

*55*(2), 247-255. https://doi.org/10.1016/0097-3165(90)90070-D

**Counting extensions.** / Spencer, Joel.

Research output: Contribution to journal › Article

*Journal of Combinatorial Theory, Series A*, vol. 55, no. 2, pp. 247-255. https://doi.org/10.1016/0097-3165(90)90070-D

}

TY - JOUR

T1 - Counting extensions

AU - Spencer, Joel

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0000037225&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000037225&partnerID=8YFLogxK

U2 - 10.1016/0097-3165(90)90070-D

DO - 10.1016/0097-3165(90)90070-D

M3 - Article

VL - 55

SP - 247

EP - 255

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 2

ER -