Tree embeddings
From MaRDI portal
Publication:2712588
DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200103)36:3<121::AID-JGT1000>3.0.CO;2-U" /><121::AID-JGT1000>3.0.CO;2-U 10.1002/1097-0118(200103)36:3<121::AID-JGT1000>3.0.CO;2-UzbMath0967.05029OpenAlexW4231986041MaRDI QIDQ2712588
Publication date: 27 August 2001
Full work available at URL: https://doi.org/10.1002/1097-0118(200103)36:3<121::aid-jgt1000>3.0.co;2-u
Related Items (25)
The vertex size-Ramsey number ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ Embedding trees in graphs with independence number two ⋮ On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices ⋮ Global maker-breaker games on sparse graphs ⋮ Ramsey goodness of trees in random graphs ⋮ Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Fast embedding of spanning trees in biased maker-breaker games ⋮ Maximum and Minimum Degree Conditions for Embedding Trees ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Ramsey Goodness of Bounded Degree Trees ⋮ Expanders Are Universal for the Class of All Spanning Trees ⋮ A sufficient degree condition for a graph to contain all trees of size \(k\) ⋮ A randomized embedding algorithm for trees ⋮ Cycle lengths in expanding graphs ⋮ Universality for bounded degree spanning trees in randomly perturbed graphs ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number ⋮ Degree Conditions for Embedding Trees ⋮ Optimal threshold for a random graph to be 2-universal ⋮ Spanning trees in random graphs ⋮ Unnamed Item ⋮ The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition ⋮ Sharp threshold for the appearance of certain spanning trees in random graphs ⋮ The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
Cites Work
This page was built for publication: Tree embeddings
