Maximum and Minimum Degree Conditions for Embedding Trees

DOI10.1137/19M1277667zbMath1451.05039arXiv1808.09934MaRDI QIDQ5128507

Guido Besomi, Matías Pavez-Signé, Maya Jakobine Stein

Publication date: 27 October 2020

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

Full work available at URL: https://arxiv.org/abs/1808.09934

zbMATH Keywords

minimum degreemaximum degreetree embedding

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (4)

Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result ⋮ Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result ⋮ A Local Approach to the Erdös--Sós Conjecture ⋮ Degree Conditions for Embedding Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Erdős-Sós conjecture for trees of large size
• Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
• Loebl-Komlós-Sós conjecture: dense case
• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdös-Sós conjecture for graphs of girth 5
• Tree embeddings
• On maximal paths and circuits of graphs
• A Local Approach to the Erdös--Sós Conjecture
• A variant of the Erdős‐Sós conjecture
• Degree Conditions for Embedding Trees
• The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition
• The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs
• The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs
• The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result
• An approximate version of the Loebl-Komlós-Sós conjecture

This page was built for publication: Maximum and Minimum Degree Conditions for Embedding Trees