Tight bounds for embedding bounded degree trees

MaRDI QIDQ3060859zbMATH OpenFDO

Authors Béla Csaba, Ian Levitt, Judit Nagy-György, Endre Szemerédi

Publication date 13 December 2010

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35)

Recommendations

• Maximum and minimum degree conditions for embedding trees
• Degree conditions for embedding trees
• Embedding nearly-spanning bounded degree trees
• Embedding trees into graphs of large girth
• Tree embeddings and tree‐star Ramsey numbers

Cited in

(18)

• Degree constrained tree embedding into points in the plane
• The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
• Spanning trees in dense directed graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
• scientific article; zbMATH DE number 1104337 (Why is no real title available?)
• Tree decompositions of graphs without large bipartite holes
• Maximum and minimum degree conditions for embedding trees
• ON BOUNDS FOR BALANCED EMBEDDING DEGREE
• Degree conditions for embedding trees
• The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
• A (1+\varepsilon)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
• A randomized embedding algorithm for trees
• Embedding loose spanning trees in 3-uniform hypergraphs
• Embedding trees with maximum and minimum degree conditions
• Cycles and trees in randomly perturbed sparse digraphs
• Counting spanning subgraphs in dense hypergraphs
• Randomly perturbed digraphs also have bounded-degree spanning trees

This page was built for publication: Tight bounds for embedding bounded degree trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060859)