Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On a Greedy 2-Matching Algorithm and Hamilton Cycles in Random Graphs
  with Minimum Degree at Least Three   We describe and analyse a simple greedy algorithm \2G\ that finds a good
2-matching $M$ in the random graph $G=G_{n,cn}^{\d\geq 3}$ when $c\geq 15$. A
2-matching is a spanning subgraph of maximum degree two and $G$ is drawn
uniformly from graphs with vertex set $[n]$, $cn$ edges and minimum degree at
least three. By good we mean that $M$ has $O(\log n)$ components. We then use
this 2-matching to build a Hamilton cycle in $O(n^{1.5+o(1)})$ time \whp.

8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
22
The categories of this paper are: chao-dyn
34
The categories of this paper are: chem-ph
9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol
31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom
18
The categories of this paper are: econ
15
The categories of this paper are: nucl-ex
5
The categories of this paper are: gr-qc
12
The categories of this paper are: nucl-th
21
The categories of this paper are: adap-org
26
The categories of this paper are: bayes-an
14
The categories of this paper are: math-ph
29
The categories of this paper are: funct-an