Induced forests and trees in Erdős-Rényi random graph
From MaRDI portal
Publication:6575360
Recommendations
Cites work
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 932179 (Why is no real title available?)
- Cliques in random graphs
- Large induced matchings in random graphs
- 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
- On induced paths, holes and trees in random graphs
- On the independence number of random graphs
- The \(t\)-stability number of a random graph
- The largest hole in sparse random graphs
Cited in
(3)
This page was built for publication: Induced forests and trees in Erdős-Rényi random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575360)