scientific article; zbMATH DE number 747032

zbMATH Open0817.05058MaRDI QIDQ4697453FDOQ4697453

Authors: Peter Dolan 

Publication date: 23 July 1995

Title of this publication is not available (Why is that?)

Recommendations

• Embedding spanning trees in random graphs
• Sharp threshold for the appearance of certain spanning trees in random graphs
• Spanning trees in random graphs
• Spanning subgraphs of random graphs

zbMATH Keywords

spanning treesrandom graph

Mathematics Subject Classification ID

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

Cited In (19)

• Spanning trees in random series-parallel graphs
• Expanders via Random Spanning Trees
• On the number of spanning trees in random regular graphs
• On the probability that a random subtree is spanning
• Sharp threshold for embedding balanced spanning trees in random geometric graphs
• Grids in random graphs
• The block connectivity of random trees
• Intersections of randomly embedded sparse graphs are Poisson
• Spanning trees in random graphs
• On spanning structures in random hypergraphs
• Matching and covering the vertices of a random graph by copies of a given graph
• Broadcasting in random graphs
• Spanning subgraphs of random graphs
• Critical behaviour of spanning forests on random planar graphs
• From elongated spanning trees to vicious random walks
• Embedding spanning trees in random graphs
• Sharp threshold for the appearance of certain spanning trees in random graphs
• Arboricity and spanning‐tree packing in random graphs
• Bounded-Degree Spanning Trees in Randomly Perturbed Graphs

This page was built for publication:

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