Large induced trees in sparse random graphs (Q1821799): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(87)90039-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017075410 / rank | |||
Normal rank | |||
Revision as of 01:18, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Large induced trees in sparse random graphs |
scientific article |
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
