Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: k-Ary spanning trees contained in tournaments   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 minimum integer such that every tournament of order at
least $h(k)$ contains a $k$-ary spanning tree. It is well-known that every
tournament contains a Hamiltonian path, which implies that $h(1)=1$. Lu et al.
[J. Graph Theory {\bf 30}(1999) 167--176] proved the existence of $h(k)$, and
showed that $h(2)=4$ and $h(3)=8$. The exact values of $h(k)$ remain unknown
for $k\geq 4$. A result of Erd\H{o}s on the domination number of tournaments
implies $h(k)=\Omega(k\log k)$. In this paper, we prove that $h(4)=10$ and
$h(5)\geq13$.

18
The categories of this paper are: econ
29
The categories of this paper are: funct-an
30
The categories of this paper are: q-alg
7
The categories of this paper are: hep-th
33
The categories of this paper are: plasm-ph
15
The categories of this paper are: nucl-ex
19
The categories of this paper are: eess
23
The categories of this paper are: solv-int
37
The categories of this paper are: supr-con
4
The categories of this paper are: cond-mat
10
The categories of this paper are: q-bio
14
The categories of this paper are: math-ph
16
The categories of this paper are: stat
28
The categories of this paper are: alg-geom
17
The categories of this paper are: q-fin
34
The categories of this paper are: chem-ph