Trees in random graphs
From MaRDI portal
Publication:790843
DOI10.1016/0012-365X(83)90247-9zbMATH Open0535.05049OpenAlexW2130264870MaRDI QIDQ790843FDOQ790843
Authors: Zbigniew Palka, P. Erdős 
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(83)90247-9
Recommendations
Cites Work
Cited In (24)
- On random cartesian trees
- Random Trees in Random Graphs
- Induced trees in sparse random graphs
- Title not available (Why is that?)
- Large holes in sparse random graphs
- The largest hole in sparse random graphs
- On Induced Paths, Holes, and Trees in Random Graphs
- Nodes of large degree in random trees and forests
- Large induced trees in \(K_r\)-free graphs
- On the order of the largest induced tree in a random graph
- Short proofs for long induced paths
- Maximal induces trees in sparse random graphs
- The block connectivity of random trees
- Maximum induced subgraphs of the binomial random graph
- Large induced trees in sparse random graphs
- The size of the largest hole in a random graph
- Dominating and large induced trees in regular graphs
- Tree components in random distance graphs of special form
- The largest hole in sparse random graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A parametric analysis of the largest induced tree problem in random graphs
- On the sizes of large subgraphs of the binomial random graph
- Large Induced Matchings in Random Graphs
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)
