The following pages link to Trees in random graphs (Q790843):
Displaying 15 items.
- Large induced trees in \(K_r\)-free graphs (Q1003853) (← links)
- Induced trees in sparse random graphs (Q1086255) (← links)
- Large holes in sparse random graphs (Q1113926) (← links)
- Maximal induces trees in sparse random graphs (Q1121286) (← links)
- The size of the largest hole in a random graph (Q1210559) (← links)
- Large induced trees in sparse random graphs (Q1821799) (← links)
- Dominating and large induced trees in regular graphs (Q2463903) (← links)
- On the sizes of large subgraphs of the binomial random graph (Q2666567) (← links)
- A parametric analysis of the largest induced tree problem in random graphs (Q3741633) (← links)
- Large Induced Matchings in Random Graphs (Q5854458) (← links)
- On Induced Paths, Holes, and Trees in Random Graphs (Q5883287) (← links)
- Short proofs for long induced paths (Q5886345) (← links)
- The largest hole in sparse random graphs (Q6052472) (← links)
- The largest hole in sparse random graphs (Q6604671) (← links)
- Maximum induced subgraphs of the binomial random graph (Q6621156) (← links)
