Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Spanning Trees in Graphs of High Minimum Degree with a Universal Vertex
  II: A Tight Result   We prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices
that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3}
\rfloor$ contains each tree $T$ with $m$ edges as a subgraph. Our result
confirms, for large $m$, an important special case of a conjecture by Havet,
Reed, Stein, and Wood. The present paper builds on the results of a companion
paper in which we proved the statement for all trees having a vertex that is
adjacent to many leaves.

4
The categories of this paper are: cond-mat
34
The categories of this paper are: chem-ph
5
The categories of this paper are: gr-qc
23
The categories of this paper are: solv-int
7
The categories of this paper are: hep-th
8
The categories of this paper are: hep-ex
11
The categories of this paper are: hep-lat
28
The categories of this paper are: alg-geom
0
The categories of this paper are: hep-ph
9
The categories of this paper are: nlin
22
The categories of this paper are: chao-dyn
26
The categories of this paper are: bayes-an
30
The categories of this paper are: q-alg
24
The categories of this paper are: dg-ga
12
The categories of this paper are: nucl-th
37
The categories of this paper are: supr-con