Maximal induces trees in sparse random graphs

DOI10.1016/0012-365X(88)90215-4zbMath0674.05055MaRDI QIDQ1121286

Tomasz Łuczak, Zbigniew Palka

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

random graphgiant componenthorn treemaximal induced trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items (10)

On Induced Paths, Holes, and Trees in Random Graphs ⋮ Short proofs for long induced paths ⋮ On tree census and the giant component in sparse random graphs ⋮ The largest hole in sparse random graphs ⋮ Maximum induced forests in random graphs ⋮ Dominating and large induced trees in regular graphs ⋮ On large induced trees and long induced paths in sparse random graphs ⋮ The size of the largest hole in a random graph ⋮ Large induced trees in \(K_r\)-free graphs ⋮ Large Induced Matchings in Random Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Trees in random graphs
• The largest tree in a random graph
• Induced trees in sparse random graphs
• On the order of the largest induced tree in a random graph
• Large holes in sparse random graphs
• Large induced trees in sparse random graphs
• Poisson convergence and random graphs

This page was built for publication: Maximal induces trees in sparse random graphs