Pages that link to "Item:Q1010862"
From MaRDI portal
The following pages link to An algorithmic Friedman-Pippenger theorem on tree embeddings and applications (Q1010862):
Displaying 4 items.
- Sparse multipartite graphs as partition universal for graphs with bounded degree (Q1743481) (← links)
- Local resilience of almost spanning trees in random graphs (Q3068763) (← links)
- An improved upper bound on the density of universal random graphs (Q4982616) (← links)
- Rolling backwards can move you forward: On embedding problems in sparse expanders (Q5082387) (← links)
