Spanning trees in random graphs

E-resources

PDF

Full text

Peer reviewed Open access

Spanning trees in random graphs

Montgomery, Richard

Advances in mathematics (New York. 1965), 11/2019, Volume: 356

Journal Article

For each Δ>0, we prove that there exists some C=C(Δ) for which the binomial random graph G(n,Clog⁡n/n) almost surely contains a copy of every tree with n vertices and maximum degree at most Δ. In doing so, we confirm a conjecture by Kahn.

Keep searching

Author

Montgomery, Richard

Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.

Year	Impact factor		Edition		Category		Classification
Year	JCR	SNIP	JCR	SNIP	JCR	SNIP	JCR	SNIP

Links to authors' personal bibliographies	Links to information on researchers in the SICRIS system

Source: Personal bibliographies and: SICRIS

Upload image

Shelf entry

Adding material to shelf was successful.

Adding material to shelf failed.

It was not necessary to add the material to the shelf.

Permalink

E-mail

Impact factor

Select the library membership card:

DRS, in which the journal is indexed

Citations

Theme