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

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

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

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.

Mathematics Subject Classification ID

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

Related Items (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)