Trees in random graphs

DOI10.1016/0012-365X(83)90247-9zbMath0535.05049OpenAlexW2130264870MaRDI QIDQ790843

Zbigniew Palka

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90247-9

zbMATH Keywords

induced starmaximal induced tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (13)

On Induced Paths, Holes, and Trees in Random Graphs ⋮ Short proofs for long induced paths ⋮ Induced trees in sparse random graphs ⋮ Large holes in sparse random graphs ⋮ A parametric analysis of the largest induced tree problem in random graphs ⋮ Maximal induces trees in sparse random graphs ⋮ On the sizes of large subgraphs of the binomial random graph ⋮ The largest hole in sparse random graphs ⋮ Dominating and large induced trees in regular graphs ⋮ The size of the largest hole in a random graph ⋮ Large induced trees in \(K_r\)-free graphs ⋮ Large induced trees in sparse random graphs ⋮ Large Induced Matchings in Random Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topological cliques of random graphs
• Cliques in random graphs

This page was built for publication: Trees in random graphs