A Local Approach to the Erdös--Sós Conjecture

DOI10.1137/18M118195XzbMath1409.05060arXiv1804.06791WikidataQ122905394 ScholiaQ122905394MaRDI QIDQ4631099

Václav Rozhoň

Publication date: 24 April 2019

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

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

zbMATH Keywords

extremal combinatoricsErdős-Sós conjectureembedding of trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

On the Erdős–Sós conjecture for trees with bounded degree ⋮ 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 ⋮ Maximum and Minimum Degree Conditions for Embedding Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Erdős-Sós conjecture for trees of large size
• The Erdős-Sós conjecture for spiders 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\)
• A skew version of the Loebl-Komlós-Sós conjecture
• The Erdös-Sós conjecture for graphs of girth 5
• The Erdős-Sós conjecture for spiders
• Constructing Trees in Graphs whose Complement has no K_2,s
• On maximal paths and circuits of graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4865531 On 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
• The Erdős‐Sós Conjecture for trees of diameter four
• Constructing trees in graphs with no K_2,s
• On the structure of linear graphs
• On the Erdős–Sós conjecture for trees with bounded degree
• An approximate version of the Loebl-Komlós-Sós conjecture

This page was built for publication: A Local Approach to the Erdös--Sós Conjecture