Trees in sparse random graphs

DOI10.1016/0095-8956(88)90056-1zbMath0662.05050OpenAlexW2139743093MaRDI QIDQ1113925

Wenceslas Fernandez de la Vega

Publication date: 1988

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(88)90056-1

zbMATH Keywords

treesrandom graph evolutionsparse Bernoulli graphs

Mathematics Subject Classification ID

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

Related Items (8)

Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths ⋮ Grids in random graphs ⋮ Rainbow trees in uniformly edge‐colored graphs ⋮ Embedding nearly-spanning bounded degree trees ⋮ Expanders Are Universal for the Class of All Spanning Trees ⋮ A randomized embedding algorithm for trees ⋮ Unnamed Item ⋮ Sharp threshold for the appearance of certain spanning trees in random graphs

Cites Work

• The longest path in a random graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Trees in sparse random graphs