Trees in random graphs
From MaRDI portal
Publication:790843
Recommendations
Cites work
Cited in
(25)- Large induced trees in \(K_r\)-free graphs
- Maximum induced subgraphs of the binomial random graph
- On Induced Paths, Holes, and Trees in Random Graphs
- Maximum induced forests in random graphs
- Induced trees in sparse random graphs
- Nodes of large degree in random trees and forests
- Large induced trees in sparse random graphs
- scientific article; zbMATH DE number 3999982 (Why is no real title available?)
- Large induced matchings in random graphs
- The largest hole in sparse random graphs
- Tree components in random distance graphs of special form
- A parametric analysis of the largest induced tree problem in random graphs
- On random cartesian trees
- On the sizes of large subgraphs of the binomial random graph
- On the order of the largest induced tree in a random graph
- Short proofs for long induced paths
- Large holes in sparse random graphs
- Dominating and large induced trees in regular graphs
- Random Trees in Random Graphs
- The largest hole in sparse random graphs
- The block connectivity of random trees
- The size of the largest hole in a random graph
- Maximal induces trees in sparse random graphs
- scientific article; zbMATH DE number 3920488 (Why is no real title available?)
- scientific article; zbMATH DE number 6123974 (Why is no real title available?)
This page was built for publication: Trees in random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790843)