Pages that link to "Item:Q555509"

The following pages link to A randomized embedding algorithm for trees (Q555509):

Displaying 7 items.

• An approximate version of Sumner's universal tournament conjecture (Q651033) (← links)
• Embedding Spanning Bipartite Graphs of Small Bandwidth (Q4903263) (← links)
• Expanders Are Universal for the Class of All Spanning Trees (Q4911172) (← links)
• Percolation on Random Graphs with a Fixed Degree Sequence (Q5020830) (← links)
• The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)
• A geometric theory for hypergraph matching (Q5497101) (← links)
• (Q5743497) (← links)