@article{ffdf8548e0f7449c8c237b89c2c8da19,
title = "Spanning trees in graphs without large bipartite holes",
abstract = "We show that for any ϵ > 0 and Δ ϵ ℕ, there exists α > 0 such that for sufficiently large n, every n-vertex graph G satisfying that δ (G)≥ ϵn and e(X, Y)> 0 for every pair of disjoint vertex sets X, Y ⊂ V(G) of size α n contains all spanning trees with maximum degree at most Δ. This strengthens a result of B{\"o}ttcher, Han, Kohayakawa, Montgomery, Parczyk, and Person.",
keywords = "Bipartite holes, Keywords:, absorbing method, spanning trees",
author = "Jie Han and Jie Hu and Lidan Ping and Guanghui Wang and Yi Wang and Donglei Yang",
note = "Publisher Copyright: {\textcopyright} The Author(s), 2023. Published by Cambridge University Press.",
year = "2023",
doi = "10.1017/S0963548323000378",
language = "English",
journal = "Combinatorics Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
}