Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Subtrees of a random tree   Let $T$ be a random tree taken uniformly at random from the family of
labelled trees on $n$ vertices. In this note, we provide bounds for $c(n)$, the
number of sub-trees of $T$ that hold asymptotically almost surely. With
computer support we show that $1.41805386^n \le c(n) \le 1.41959881^n$.
Moreover, there is a strong indication that, in fact, $c(n) \le 1.41806183^n$.

29
The categories of this paper are: funct-an
5
The categories of this paper are: gr-qc
22
The categories of this paper are: chao-dyn
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
9
The categories of this paper are: nlin
21
The categories of this paper are: adap-org
19
The categories of this paper are: eess
17
The categories of this paper are: q-fin
31
The categories of this paper are: ao-sci
14
The categories of this paper are: math-ph
3
The categories of this paper are: physics
11
The categories of this paper are: hep-lat
15
The categories of this paper are: nucl-ex
12
The categories of this paper are: nucl-th
30
The categories of this paper are: q-alg