Embedding trees into graphs of large girth

DOI10.1016/S0012-365X(99)00354-4zbMATH Open0958.05030OpenAlexW2066380283WikidataQ127740025 ScholiaQ127740025MaRDI QIDQ1567289FDOQ1567289

Authors: Penny Haxell, Tomasz Łuczak 

Publication date: 30 March 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00354-4

Recommendations

• On a conjecture about trees in graphs with large girth
• On graphs which contain each tree of given size
• Degree conditions for embedding trees
• Maximum and minimum degree conditions for embedding trees

zbMATH Keywords

graph girthtree embeddings

Mathematics Subject Classification ID

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

Cited In (10)

• Maximum and minimum degree conditions for embedding trees
• A randomized embedding algorithm for trees
• Subtrees and subforests of graphs
• Tight bounds for embedding bounded degree trees
• Tree embeddings and tree‐star Ramsey numbers
• Embedding meshes of trees into deBruijn graphs
• Embedding trees with maximum and minimum degree conditions
• A note on the Size-Ramsey number of long subdivisions of graphs
• On a conjecture about trees in graphs with large girth
• Embedding trees in recursive circulants

This page was built for publication: Embedding trees into graphs of large girth

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