Induced trees in sparse random graphs

DOI10.1007/BF01788097zbMath0608.05067MaRDI QIDQ1086255

Wenceslas Fernandez de la Vega

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

random graphinduced tree

Mathematics Subject Classification ID

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

Related Items (11)

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 ⋮ Maximal induces trees in sparse random graphs ⋮ The largest hole in sparse random graphs ⋮ Average case analysis of greedy algorithms for optimisation problems on set systems ⋮ Induced trees in triangle-free 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
• Unnamed Item
• Unnamed Item
• Trees in random graphs
• The largest tree in a random graph
• Induced trees in sparse random graphs
• The longest path in a random graph
• Solutions of ordinary differential equations as limits of pure jump markov processes

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