Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result

DOI10.1002/jgt.22897zbMath1522.05049arXiv1905.09801MaRDI QIDQ6094046

Maya Jakobine Stein, Bruce A. Reed

Publication date: 9 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

spanning treeminimum degreemaximum degree

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Erdös-Sós conjecture for graphs of girth 5
• Tree embeddings
• Spanning Trees in Dense Graphs
• 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
• Maximum and Minimum Degree Conditions for Embedding Trees
• 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
• On the Erdős–Sós conjecture for trees with bounded degree
• An approximate version of the Loebl-Komlós-Sós conjecture