Hyde, JosephReed, Bruce2023-10-062023-10-0620232023Hyde, J., & Reed, B. (2023). Graphs of minimum degree at least ⌊d/2⌋ and large enough maximum degree embed every tree with d vertices. Procedia Computer Science, 223, 217-222. https://doi.org/10.1016/j.procs.2023.08.263.https://doi.org/10.1016/j.procs.2023.08.263http://hdl.handle.net/1828/15486For d ϵ N, we show that there exists a function f(d) such that every graph G with ∆(G) ≥ f(d) and δ(G) ≥ ⌊d/2⌋ contains every tree on d vertices as a subgraph.enTree embeddingminimum degreemaximum degreeArticleDepartment of Mathematics and Statistics