Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Asymptotic bounds on graphical partitions and partition comparability   An integer partition is called graphical if it is the degree sequence of a
simple graph. We prove that the probability that a uniformly chosen partition
of size $n$ is graphical decreases to zero faster than $n^{-.003}$, answering a
question of Pittel. A lower bound of $n^{-1/2}$ was proven by Erd\H{o}s and
Richmond, and so this demonstrates that the probability decreases polynomially.
Key to our argument is an asymptotic result of Pittel characterizing the joint
distribution of the first rows and columns of a uniformly random partition,
combined with a characterization of graphical partitions due to Erd\H{o}s and
Gallai. Our proof also implies a polynomial upper bound for the probability
that two randomly chosen partitions are comparable in the dominance order.

6
The categories of this paper are: astro-ph
19
The categories of this paper are: eess
32
The categories of this paper are: atom-ph
11
The categories of this paper are: hep-lat
26
The categories of this paper are: bayes-an
15
The categories of this paper are: nucl-ex
14
The categories of this paper are: math-ph
27
The categories of this paper are: comp-gas
13
The categories of this paper are: quant-ph
25
The categories of this paper are: patt-sol
30
The categories of this paper are: q-alg
8
The categories of this paper are: hep-ex
17
The categories of this paper are: q-fin
22
The categories of this paper are: chao-dyn
33
The categories of this paper are: plasm-ph
7
The categories of this paper are: hep-th