Spanning trees in dense directed graphs

Amarja Kathapurkar, Richard Montgomery

In 2001, Komlós, Sárközy and Szemerédi proved that, for each $\alpha >0$, there is some $c>0$ and $n_0$ such that, if $n\ge n_0$, then every $n$-vertex graph with minimum degree at leas…