On the Erd\H{o}s-S\'os conjecture for trees with bounded degree

DOI10.1017/S0963548320000528zbMATH Open1510.05132arXiv1906.10219WikidataQ122925277 ScholiaQ122925277MaRDI QIDQ6320993FDOQ6320993

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

Publication date: 24 June 2019

Abstract: We prove the ErdH os--S'os 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.

Recommendations

• On Erdős-Sós conjecture for trees of large size
• A Local Approach to the Erdös--Sós Conjecture
• scientific article; zbMATH DE number 3885926
• On the Erd�s-S�s conjecture
• On the Erdős-Sós conjecture for graphs on \(n=k+3\) vertices.

Mathematics Subject Classification ID

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

Cited In (1)

• The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs

This page was built for publication: On the Erd\H{o}s-S\'os conjecture for trees with bounded degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6320993)