Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Tensor networks and the enumeration of regular subgraphs   We propose a universal approach to a range of enumeration problems in graphs.
The key point is in contracting suitably chosen symmetric tensors placed at the
vertices of a graph along the edges. In particular, this leads to an algorithm
that counts the number of d-regular subgraphs of an arbitrary graph including
the number of d-factors (previously we considered the case d=2 with a special
emphasis on the enumeration of Hamiltonian cycles; cf. math.CO/0403339). We
briefly discuss the problem of the computational complexity of this algorithm.

7
The categories of this paper are: hep-th
25
The categories of this paper are: patt-sol
19
The categories of this paper are: eess
10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an
5
The categories of this paper are: gr-qc
12
The categories of this paper are: nucl-th
27
The categories of this paper are: comp-gas
8
The categories of this paper are: hep-ex
6
The categories of this paper are: astro-ph
13
The categories of this paper are: quant-ph
4
The categories of this paper are: cond-mat
34
The categories of this paper are: chem-ph
21
The categories of this paper are: adap-org
35
The categories of this paper are: mtrl-th
1
The categories of this paper are: cs