On the Erdős–Sós conjecture for trees with bounded degree

DOI10.1017/S0963548320000528WikidataQ122925277 ScholiaQ122925277MaRDI QIDQ5886108

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

Publication date: 30 March 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

multicolour Ramsey number of large treestrees with bounded maximum degree

Mathematics Subject Classification ID

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

Related Items

Ramsey goodness of trees in random graphs, 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
• The Erdös-Sós conjecture for graphs of girth 5
• Spanning trees in random graphs
• Embedding Spanning Trees in Random 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
• Degree Conditions for Embedding Trees
• The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result