Spanning trees in graphs without large bipartite holes

Jie Han, Jie Hu, Lidan Ping +3

We show that for any $\epsilon >0$ and $\Delta \in \mathbb{N}$, there exists $\alpha >0$ such that for sufficiently large $n$, every $n$-vertex graph $G$ satisfying that $δ(G)\geq\varepsilon…