k-Ary spanning trees contained in tournaments

Jiangdong Ai, Hui Lei, Yongtang Shi +2

A rooted tree is called a $k$-ary tree, if all non-leaf vertices have exactly $k$ children, except possibly one non-leaf vertex has at most $k-1$ children. Denote by $h(k)$ the min…