On large induced trees and long induced paths in sparse random graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(15)- On induced paths, holes and trees in random graphs
- On depth first search trees in \(m\)-out digraphs
- Induced trees in sparse random graphs
- Finding paths in sparse random graphs requires many queries
- Large induced matchings in random graphs
- The largest hole in sparse random graphs
- On Induced Paths, Holes, and Trees in Random Graphs
- Large induced trees in \(K_r\)-free graphs
- Maximal induces trees in sparse random graphs
- MIP formulations for induced graph optimization problems: a tutorial
- Short proofs for long induced paths
- Large induced trees in sparse random graphs
- A scaling limit for the length of the longest cycle in a sparse random graph
- The largest hole in sparse random graphs
- A parametric analysis of the largest induced tree problem in random graphs
This page was built for publication: On large induced trees and long induced paths in sparse random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1204462)