Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Minimal bricks   A brick is a 3-connected graph such that the graph obtained from it by
deleting any two distinct vertices has a perfect matching. A brick is minimal
if for every edge e the deletion of e results in a graph that is not a brick.
We prove a generation theorem for minimal bricks and two corollaries: (1) for
n>4, every minimal brick on 2n vertices has at most 5n-7 edges, and (2) every
minimal brick has at least three vertices of degree three.

28
The categories of this paper are: alg-geom
18
The categories of this paper are: econ
6
The categories of this paper are: astro-ph
23
The categories of this paper are: solv-int
0
The categories of this paper are: hep-ph
26
The categories of this paper are: bayes-an
5
The categories of this paper are: gr-qc
22
The categories of this paper are: chao-dyn
36
The categories of this paper are: cmp-lg
30
The categories of this paper are: q-alg
13
The categories of this paper are: quant-ph
12
The categories of this paper are: nucl-th
37
The categories of this paper are: supr-con
24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin
7
The categories of this paper are: hep-th