Counting extensions

Research output: Contribution to journalArticle

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

Fingerprint

Counting
Count
Expected Value
Random Graphs
Triangle
Roots
Path
Vertex of a graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Counting extensions. / Spencer, Joel.

In: Journal of Combinatorial Theory, Series A, Vol. 55, No. 2, 1990, p. 247-255.

Research output: Contribution to journalArticle

@article{f2e32d30d26b4e69b482bec147b25415,
title = "Counting extensions",
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.",
author = "Joel Spencer",
year = "1990",
doi = "10.1016/0097-3165(90)90070-D",
language = "English (US)",
volume = "55",
pages = "247--255",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "2",

}

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 -