Pages that link to "Item:Q1204462"

The following pages link to On large induced trees and long induced paths in sparse random graphs (Q1204462):

Displaying 15 items.

• On depth first search trees in \(m\)-out digraphs (Q684408) (← links)
• Large induced trees in \(K_r\)-free graphs (Q1003853) (← links)
• Induced trees in sparse random graphs (Q1086255) (← links)
• Maximal induces trees in sparse random graphs (Q1121286) (← links)
• Large induced trees in sparse random graphs (Q1821799) (← links)
• A scaling limit for the length of the longest cycle in a sparse random graph (Q1998764) (← links)
• Finding paths in sparse random graphs requires many queries (Q2951884) (← links)
• A parametric analysis of the largest induced tree problem in random graphs (Q3741633) (← links)
• The largest induced tree in a sparse random graph (Q4894603) (← 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)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• The largest hole in sparse random graphs (Q6604671) (← links)