Pages that link to "Item:Q4894603"
From MaRDI portal
The following pages link to The largest induced tree in a sparse random graph (Q4894603):
Displaying 20 items.
- Trees in random graphs (Q790843) (← links)
- Large induced trees in \(K_r\)-free graphs (Q1003853) (← links)
- Induced trees in sparse random graphs (Q1086255) (← links)
- On the order of the largest induced tree in a random graph (Q1088688) (← links)
- Maximal induces trees in sparse random graphs (Q1121286) (← links)
- On large induced trees and long induced paths in sparse random graphs (Q1204462) (← links)
- Large induced trees in sparse random graphs (Q1821799) (← links)
- Maximum sparse induced subgraphs of the binomial random graph with given number of edges (Q2214056) (← links)
- Maximum induced forests in random graphs (Q2235276) (← links)
- Dominating and large induced trees in regular graphs (Q2463903) (← links)
- Largest sparse subgraphs of random graphs (Q2857370) (← links)
- Property testers for dense constraint satisfaction programs on finite domains (Q3150197) (← links)
- A parametric analysis of the largest induced tree problem in random graphs (Q3741633) (← links)
- Polynomial time approximation schemes for dense instances of minimum constraint satisfaction (Q4417004) (← 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)
- Induced forests and trees in Erdős-Rényi random graph (Q6575360) (← links)
- The largest hole in sparse random graphs (Q6604671) (← links)
