Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Long cycles through prescribed vertices have the Erd\H{o}s-P\'osa
  property   We prove that for every graph, any vertex subset $S$, and given integers
$k,\ell$: there are $k$ disjoint cycles of length at least $\ell$ that each
contain at least one vertex from $S$, or a vertex set of size $O(\ell \cdot k
\log k)$ that meets all such cycles. This generalises previous results of
Fiorini and Hendrickx and of Pontecorvi and Wollan.
  In addition, we describe an algorithm for our main result that runs in $O(k
\log k \cdot s^2 \cdot (f(\ell) \cdot n+m))$ time, where $s$ denotes the
cardinality of $S$.

9
The categories of this paper are: nlin
4
The categories of this paper are: cond-mat
15
The categories of this paper are: nucl-ex
1
The categories of this paper are: cs
26
The categories of this paper are: bayes-an
7
The categories of this paper are: hep-th
16
The categories of this paper are: stat
37
The categories of this paper are: supr-con
14
The categories of this paper are: math-ph
12
The categories of this paper are: nucl-th
35
The categories of this paper are: mtrl-th
36
The categories of this paper are: cmp-lg
0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc
34
The categories of this paper are: chem-ph
33
The categories of this paper are: plasm-ph