Pages that link to "Item:Q1121286"

The following pages link to Maximal induces trees in sparse random graphs (Q1121286):

Displaying 10 items.

• Large induced trees in \(K_r\)-free graphs (Q1003853) (← links)
• On large induced trees and long induced paths in sparse random graphs (Q1204462) (← links)
• The size of the largest hole in a random graph (Q1210559) (← links)
• Maximum induced forests in random graphs (Q2235276) (← links)
• Dominating and large induced trees in regular graphs (Q2463903) (← links)
• On tree census and the giant component in sparse random graphs (Q3970912) (← 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)