Large induced trees in sparse random graphs (Q1821799): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Long paths in sparse random graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3286850 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4065548 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Trees in random graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Large holes in sparse random graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The largest tree in a random graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the order of the largest induced tree in a random graph / rank | |||
Normal rank | |||
Latest revision as of 18:33, 17 June 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
0 references
