Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Packing degenerate graphs   Given $D$ and $\gamma>0$, whenever $c>0$ is sufficiently small and $n$
sufficiently large, if $\mathcal{G}$ is a family of $D$-degenerate graphs of
individual orders at most $n$, maximum degrees at most $\tfrac{cn}{\log n}$,
and total number of edges at most $(1-\gamma)\binom{n}{2}$, then $\mathcal{G}$
packs into the complete graph $K_{n}$. Our proof proceeds by analysing a
natural random greedy packing algorithm.
  This version of the manuscript corrects a small error that appeared in the
published version [Adv Math, 354 (2019), 106739].

36
The categories of this paper are: cmp-lg
8
The categories of this paper are: hep-ex
0
The categories of this paper are: hep-ph
28
The categories of this paper are: alg-geom
34
The categories of this paper are: chem-ph
7
The categories of this paper are: hep-th
21
The categories of this paper are: adap-org
27
The categories of this paper are: comp-gas
5
The categories of this paper are: gr-qc
23
The categories of this paper are: solv-int
9
The categories of this paper are: nlin
37
The categories of this paper are: supr-con
10
The categories of this paper are: q-bio
19
The categories of this paper are: eess
6
The categories of this paper are: astro-ph
33
The categories of this paper are: plasm-ph