Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Longest cycles in 3-connected hypergraphs and bipartite graphs   In the language of hypergraphs, our main result is a Dirac-type bound: we
prove that every $3$-connected hypergraph $H$ with $ \delta(H)\geq
\max\{|V(H)|, \frac{|E(H)|+10}{4}\}$ has a hamiltonian Berge cycle.
  This is sharp and refines a conjecture by Jackson from 1981 (in the language
of bipartite graphs). Our proofs are in the language of bipartite graphs, since
the incidence graph of each hypergraph is bipartite.

37
The categories of this paper are: supr-con
13
The categories of this paper are: quant-ph
0
The categories of this paper are: hep-ph
7
The categories of this paper are: hep-th
21
The categories of this paper are: adap-org
4
The categories of this paper are: cond-mat
3
The categories of this paper are: physics
26
The categories of this paper are: bayes-an
9
The categories of this paper are: nlin
19
The categories of this paper are: eess
35
The categories of this paper are: mtrl-th
8
The categories of this paper are: hep-ex
6
The categories of this paper are: astro-ph
5
The categories of this paper are: gr-qc
12
The categories of this paper are: nucl-th
33
The categories of this paper are: plasm-ph