The following pages link to Tree embeddings (Q2712588):
Displaying 26 items.
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345) (← links)
- The vertex size-Ramsey number (Q267205) (← links)
- On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices (Q389980) (← links)
- Fast embedding of spanning trees in biased maker-breaker games (Q427795) (← links)
- A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277) (← links)
- A randomized embedding algorithm for trees (Q555509) (← links)
- Global maker-breaker games on sparse graphs (Q616371) (← links)
- Cycle lengths in expanding graphs (Q2036619) (← links)
- Subdivisions in digraphs of large out-degree or large dichromatic number (Q2315440) (← links)
- Spanning trees in random graphs (Q2326663) (← links)
- Sharp threshold for the appearance of certain spanning trees in random graphs (Q3145834) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Embedding trees in graphs with independence number two (Q4577857) (← links)
- Ramsey Goodness of Bounded Degree Trees (Q4635503) (← links)
- Expanders Are Universal for the Class of All Spanning Trees (Q4911172) (← links)
- Rolling backwards can move you forward: On embedding problems in sparse expanders (Q5082387) (← links)
- Maximum and Minimum Degree Conditions for Embedding Trees (Q5128507) (← links)
- Universality for bounded degree spanning trees in randomly perturbed graphs (Q5216180) (← links)
- Degree Conditions for Embedding Trees (Q5232383) (← 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)
- (Q5743497) (← links)
- Ramsey goodness of trees in random graphs (Q6076209) (← links)
- Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result (Q6094046) (← links)
- Towards the Erdős-Gallai cycle decomposition conjecture (Q6184561) (← links)
- Almost spanning distance trees in subsets of finite vector spaces (Q6499409) (← links)
