Trees in sparse random graphs

DOI10.1016/0095-8956(88)90056-1MaRDI QIDQ1113925zbMATH OpenOpenAlexFDO

Authors W. 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)

Cites work

• scientific article; zbMATH DE number 3916307 (Why is no real title available?)
• scientific article; zbMATH DE number 3693325 (Why is no real title available?)
• The longest path in a random graph

Cited in

(14)

• Spanning trees in random series-parallel graphs
• Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
• Expanders Are Universal for the Class of All Spanning Trees
• Embedding nearly-spanning bounded degree trees
• A randomized embedding algorithm for trees
• Grids in random graphs
• Maximal induces trees in sparse random graphs
• The block connectivity of random trees
• Large induced trees in sparse random graphs
• Rainbow trees in uniformly edge‐colored graphs
• Tree components in random distance graphs of special form
• scientific article; zbMATH DE number 6123974 (Why is no real title available?)
• Sharp threshold for the appearance of certain spanning trees in random graphs
• Expanders are universal for the class of all spanning trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1113925)