On large induced trees and long induced paths in sparse random graphs (Q1204462)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On large induced trees and long induced paths in sparse random graphs |
scientific article; zbMATH DE number 130558
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On large induced trees and long induced paths in sparse random graphs |
scientific article; zbMATH DE number 130558 |
Statements
On large induced trees and long induced paths in sparse random graphs (English)
0 references
10 March 1993
0 references
By analyzing an algorithm for finding the induced trees in a graph, probabilistic bounds are obtained on the order of the largest induced tree in a sparse random graph. Similar results on the length of the longest induced path are obtained by considering the path joining the root of an induced tree to a leaf.
0 references
induced tree
0 references
random graph
0 references
induced path
0 references
