Random trees in a graph and trees in a random graph
From MaRDI portal
Publication:3759604
DOI10.1017/S0305004100066111zbMATH Open0622.60018OpenAlexW2143442844MaRDI QIDQ3759604FDOQ3759604
Publication date: 1986
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0305004100066111
Recommendations
- On the number of subtrees for almost all graphs
- On the number of trees having \(k\) edges in common with a graph of bounded degrees
- Unions of random trees and applications
- The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
- scientific article; zbMATH DE number 1380601
degenerate distributionnumber of edges in the intersection or union of more than two random treesWeak convergences
Cites Work
Cited In (10)
- On random cartesian trees
- Random graphs and the strong convergence of bootstrap means
- Unions of random trees and applications
- Poisson convergence and Poisson processes with applications to random graphs
- On the probability that a random subtree is spanning
- On Induced Paths, Holes, and Trees in Random Graphs
- Intersections of randomly embedded sparse graphs are Poisson
- Title not available (Why is that?)
- Tree components in random distance graphs of special form
- The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
This page was built for publication: Random trees in a graph and trees in a random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3759604)