Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A short proof of the middle levels theorem   Consider the graph that has as vertices all bitstrings of length $2n+1$ with
exactly $n$ or $n+1$ entries equal to 1, and an edge between any two bitstrings
that differ in exactly one bit. The well-known middle levels conjecture asserts
that this graph has a Hamilton cycle for any $n\geq 1$. In this paper we
present a new proof of this conjecture, which is much shorter and more
accessible than the original proof.

12
The categories of this paper are: nucl-th
29
The categories of this paper are: funct-an
0
The categories of this paper are: hep-ph
22
The categories of this paper are: chao-dyn
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
24
The categories of this paper are: dg-ga
7
The categories of this paper are: hep-th
35
The categories of this paper are: mtrl-th
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
26
The categories of this paper are: bayes-an
13
The categories of this paper are: quant-ph
21
The categories of this paper are: adap-org
25
The categories of this paper are: patt-sol