Graphs of minimum degree at least left perpendicular d/2 right perpendicular and large enough maximum degree embed every tree with d vertices

For d is an element of N, we show that there exists a function f(d) such that every graph G with Delta(G) >= f(d) and delta(G) >= left perpendicular d/2 right perpendicular contains every tree on d vertices as a subgraph. (C) 2023 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0)