Counting extensions

Joel Spencer

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Pages (from-to)247-255
Number of pages9
JournalJournal of Combinatorial Theory, Series A
Issue number2
StatePublished - Nov 1990

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Counting extensions'. Together they form a unique fingerprint.

Cite this