Random trees in a graph and trees in a random graph
From MaRDI portal
Publication:3759604
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
Cited in
(16)- On Induced Paths, Holes, and Trees in Random Graphs
- Random subtrees and unimodal sequences in graphs
- Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component
- Models of random subtrees of a graph
- scientific article; zbMATH DE number 3948293 (Why is no real title available?)
- Intersections of randomly embedded sparse graphs are Poisson
- Tree components in random distance graphs of special form
- On random cartesian trees
- Poisson convergence and Poisson processes with applications to random graphs
- Unions of random trees and applications
- Random graphs and the strong convergence of bootstrap means
- On the number of transversals in random trees
- On the probability that a random subtree is spanning
- A distributional study of the path edge-covering numbers for random trees
- Subtrees of graphs
- 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)
