A parametric analysis of the largest induced tree problem in random graphs

DOI10.1051/ita/1986200302111zbMath0604.05014OpenAlexW183530696MaRDI QIDQ3741633

Maurizio Talamo, Marco Protasi

Publication date: 1986

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92257

zbMATH Keywords

random graphslargest induced tree

Mathematics Subject Classification ID

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

Related Items (1)

Dominating and large induced trees in regular graphs

Cites Work

• Trees in random graphs
• The largest tree in a random graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A parametric analysis of the largest induced tree problem in random graphs