Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Critical Independence Number and an Independence Decomposition   An independent set $I_c$ is a \textit{critical independent set} if $|I_c| -
|N(I_c)| \geq |J| - |N(J)|$, for any independent set $J$. The \textit{critical
independence number} of a graph is the cardinality of a maximum critical
independent set. This number is a lower bound for the independence number and
can be computed in polynomial-time. Any graph can be decomposed into two
subgraphs where the independence number of one subgraph equals its critical
independence number, where the critical independence number of the other
subgraph is zero, and where the sum of the independence numbers of the
subgraphs is the independence number of the graph. A proof of a conjecture of
Graffiti.pc yields a new characterization of K\"{o}nig-Egervary graphs: these
are exactly the graphs whose independence and critical independence numbers are
equal.

12
The categories of this paper are: nucl-th
15
The categories of this paper are: nucl-ex
34
The categories of this paper are: chem-ph
29
The categories of this paper are: funct-an
33
The categories of this paper are: plasm-ph
14
The categories of this paper are: math-ph
4
The categories of this paper are: cond-mat
13
The categories of this paper are: quant-ph
28
The categories of this paper are: alg-geom
16
The categories of this paper are: stat
25
The categories of this paper are: patt-sol
11
The categories of this paper are: hep-lat
21
The categories of this paper are: adap-org
26
The categories of this paper are: bayes-an
37
The categories of this paper are: supr-con
17
The categories of this paper are: q-fin