On large induced trees and long induced paths in sparse random graphs

DOI10.1016/0095-8956(92)90021-OzbMath0779.05052OpenAlexW2040697623MaRDI QIDQ1204462

W. C. Stephen Suen

Publication date: 10 March 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90021-o

zbMATH Keywords

random graphinduced treeinduced path

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

On Induced Paths, Holes, and Trees in Random Graphs ⋮ Short proofs for long induced paths ⋮ The largest hole in sparse random graphs ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ On depth first search trees in \(m\)-out digraphs ⋮ A scaling limit for the length of the longest cycle in a sparse random graph ⋮ Large induced trees in \(K_r\)-free graphs ⋮ Large Induced Matchings in Random Graphs

Cites Work

• Unnamed Item
• On depth first search trees in \(m\)-out digraphs
• Large holes in sparse random graphs
• Maximal induces trees in sparse random graphs
• Large induced trees in sparse random graphs

This page was built for publication: On large induced trees and long induced paths in sparse random graphs