Sharp threshold for the appearance of certain spanning trees in random graphs

Dan Hefetz; Michael Krivelevich; Tibor Szabó

doi:10.1002/rsa.20472

Sharp threshold for the appearance of certain spanning trees in random graphs

Dan Hefetz, Michael Krivelevich, Tibor Szabó

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

Abstract

We prove that a given tree T on n vertices with bounded maximum degree is contained asymptotically almost surely in the binomial random graph G(n, (1+ε) log n/n) provided that T belongs to one of the following two classes: (1) T has linearly many leaves; (2) T has a path of linear length all of whose vertices have degree two in T.

Original language	English
Pages (from-to)	391-412
Number of pages	22
Journal	Random Structures and Algorithms
Volume	41
Issue number	4
DOIs	https://doi.org/10.1002/rsa.20472
State	Published - Dec 2012
Externally published	Yes

Keywords

Random graphs
Sharp thresholds
Spanning trees
Tree-universality

Access to Document

10.1002/rsa.20472

Cite this

@article{8124715a9b7b438882e9676413eb6c17,

title = "Sharp threshold for the appearance of certain spanning trees in random graphs",

abstract = "We prove that a given tree T on n vertices with bounded maximum degree is contained asymptotically almost surely in the binomial random graph G(n, (1+ε) log n/n) provided that T belongs to one of the following two classes: (1) T has linearly many leaves; (2) T has a path of linear length all of whose vertices have degree two in T.",

keywords = "Random graphs, Sharp thresholds, Spanning trees, Tree-universality",

author = "Dan Hefetz and Michael Krivelevich and Tibor Szab{\'o}",

year = "2012",

month = dec,

doi = "10.1002/rsa.20472",

language = "אנגלית",

volume = "41",

pages = "391--412",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "4",

}

TY - JOUR

T1 - Sharp threshold for the appearance of certain spanning trees in random graphs

AU - Hefetz, Dan

AU - Krivelevich, Michael

AU - Szabó, Tibor

PY - 2012/12

Y1 - 2012/12

N2 - We prove that a given tree T on n vertices with bounded maximum degree is contained asymptotically almost surely in the binomial random graph G(n, (1+ε) log n/n) provided that T belongs to one of the following two classes: (1) T has linearly many leaves; (2) T has a path of linear length all of whose vertices have degree two in T.

AB - We prove that a given tree T on n vertices with bounded maximum degree is contained asymptotically almost surely in the binomial random graph G(n, (1+ε) log n/n) provided that T belongs to one of the following two classes: (1) T has linearly many leaves; (2) T has a path of linear length all of whose vertices have degree two in T.

KW - Random graphs

KW - Sharp thresholds

KW - Spanning trees

KW - Tree-universality

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

U2 - 10.1002/rsa.20472

DO - 10.1002/rsa.20472

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84868207069

SN - 1042-9832

VL - 41

SP - 391

EP - 412

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 4

ER -

Sharp threshold for the appearance of certain spanning trees in random graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this