Author:
Besomi Guido,Pavez-Signé Matías,Stein Maya
Abstract
AbstractWe prove the Erdős–Sós conjecture for trees with bounded maximum degree and large dense host graphs. As a corollary, we obtain an upper bound on the multicolour Ramsey number of large trees whose maximum degree is bounded by a constant.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference16 articles.
1. The Erdős–Sós Conjecture for Graphs withoutC4
2. On maximal paths and circuits of graphs
3. A variant of the Erdős‐Sós conjecture
4. [13] Reed, B. and Stein, M. (2019) Spanning trees in graphs of high minimum degree with a universal vertex I: An approximate asymptotic result. arXiv:1905.09801
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. How connectivity affects the extremal number of trees;Journal of Combinatorial Theory, Series B;2024-07
2. Oriented Trees and Paths in Digraphs;Surveys in Combinatorics 2024;2024-06-13
3. Graphs of minimum degree at least ⌊d/2⌋ and large enough maximum degree embed every tree with d vertices;Procedia Computer Science;2023
4. How connectivity affects the extremal number of trees;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
5. Beyond the Erdős–Sós conjecture;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023