Maximum induced trees in sparse random graphs
From MaRDI portal
Recommendations
Cites work
- Cliques in random graphs
- Disproof of the zero-one law for existential monadic properties of a sparse binomial random graph
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- Independence numbers of random subgraphs of some distance graph
- Largest sparse subgraphs of random graphs
- Maximum induced forests in random graphs
- Maximum sparse induced subgraphs of the binomial random graph with given number of edges
- Monadic second-order properties of very sparse random graphs
- On the probability of independent sets in random graphs
- On the sizes of large subgraphs of the binomial random graph
- Paths in graphs
- Random graphs: models and asymptotic characteristics
- Two-Point Concentration of the Independence Number of the Random Graph
Cited in
(3)
This page was built for publication: Maximum induced trees in sparse random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575370)