Large induced trees in sparse random graphs (Q1821799)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3999983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Large induced trees in sparse random graphs |
scientific article; zbMATH DE number 3999983 |
Statements
Large induced trees in sparse random graphs (English)
0 references
1987
0 references
Random graphs, random regular graphs, and random regular digraphs where the average degree is constant are shown to have spanning trees almost surely.
0 references
induced trees
0 references
Random graphs
0 references
random regular graphs
0 references
random regular digraphs
0 references
0 references
0 references
0.9694934
0 references
0 references
0 references
0.9356788
0 references
0.9223151
0 references
0 references
