Pages that link to "Item:Q950331"
From MaRDI portal
The following pages link to Embedding nearly-spanning bounded degree trees (Q950331):
Displaying 26 items.
- Fast embedding of spanning trees in biased maker-breaker games (Q427795) (← links)
- A randomized embedding algorithm for trees (Q555509) (← links)
- Global maker-breaker games on sparse graphs (Q616371) (← links)
- Embedding spanning bounded degree subgraphs in randomly perturbed graphs (Q1689904) (← links)
- Sparse multipartite graphs as partition universal for graphs with bounded degree (Q1743481) (← links)
- Random perturbation of sparse graphs (Q2030748) (← links)
- Spanning trees in random graphs (Q2326663) (← links)
- The total acquisition number of random graphs (Q2629497) (← links)
- Universality of random graphs and rainbow embedding (Q2811163) (← links)
- Almost spanning subgraphs of random graphs after adversarial edge removal (Q2840559) (← links)
- Spanning structures and universality in sparse hypergraphs (Q2953700) (← links)
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs (Q2957690) (← links)
- Cycle Factors and Renewal Theory (Q2958190) (← links)
- Local resilience of almost spanning trees in random graphs (Q3068763) (← links)
- Sharp threshold for the appearance of certain spanning trees in random graphs (Q3145834) (← links)
- Expanders Are Universal for the Class of All Spanning Trees (Q4911172) (← links)
- An improved upper bound on the density of universal random graphs (Q4982616) (← links)
- Hamiltonicity in random directed graphs is born resilient (Q4993114) (← links)
- Rolling backwards can move you forward: On embedding problems in sparse expanders (Q5082387) (← links)
- Universality for bounded degree spanning trees in randomly perturbed graphs (Q5216180) (← links)
- Optimal threshold for a random graph to be 2-universal (Q5234488) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)
- The threshold for combs in random graphs (Q5740276) (← links)
- (Q5743497) (← links)
- Universal and unavoidable graphs (Q5886120) (← links)
- Rainbow trees in uniformly edge‐colored graphs (Q6074865) (← links)
