Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The challenges of unbounded treewidth in parameterised subgraph counting
  problems   Parameterised subgraph counting problems are the most thoroughly studied
topic in the theory of parameterised counting, and there has been significant
recent progress in this area. Many of the existing tractability results for
parameterised problems which involve finding or counting subgraphs with
particular properties rely on bounding the treewidth of these subgraphs in some
sense; here, we prove a number of hardness results for the situation in which
this bounded treewidth condition does not hold, resulting in dichotomies for
some special cases of the general subgraph counting problem. The paper also
gives a thorough survey of known results on this subject and the methods used,
as well as discussing the relationships both between multicolour and uncoloured
versions of subgraph counting problems, and between exact counting, approximate
counting and the corresponding decision problems.

35
The categories of this paper are: mtrl-th
37
The categories of this paper are: supr-con
29
The categories of this paper are: funct-an
8
The categories of this paper are: hep-ex
10
The categories of this paper are: q-bio
5
The categories of this paper are: gr-qc
6
The categories of this paper are: astro-ph
0
The categories of this paper are: hep-ph
3
The categories of this paper are: physics
30
The categories of this paper are: q-alg
25
The categories of this paper are: patt-sol
34
The categories of this paper are: chem-ph
9
The categories of this paper are: nlin
18
The categories of this paper are: econ
28
The categories of this paper are: alg-geom
23
The categories of this paper are: solv-int