Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Minimally Connected Hypergraphs   Graphs and hypergraphs are foundational structures in discrete mathematics.
They have many practical applications, including the rapidly developing field
of bioinformatics, and more generally, biomathematics. They are also a source
of interesting algorithmic problems. In this paper, we define a
\textit{construction process} for minimally connected $r$-uniform hypergraphs,
which captures the intuitive notion of building a hypergraph piece-by-piece,
and a numerical invariant called the \textit{tightness}, which is independent
of the construction process used. Using these tools, we prove some fundamental
properties of minimally connected hypergraphs. We also give bounds on their
chromatic numbers and provide some results involving edge colorings. We show
that every connected $r$-uniform hypergraph contains a minimally connected
spanning subhypergraph and provide a polynomial-time algorithm for identifying
such a subhypergraph.

7
The categories of this paper are: hep-th
32
The categories of this paper are: atom-ph
1
The categories of this paper are: cs
15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
18
The categories of this paper are: econ
3
The categories of this paper are: physics
34
The categories of this paper are: chem-ph
36
The categories of this paper are: cmp-lg
16
The categories of this paper are: stat
14
The categories of this paper are: math-ph
19
The categories of this paper are: eess
20
The categories of this paper are: acc-phys
10
The categories of this paper are: q-bio
21
The categories of this paper are: adap-org
35
The categories of this paper are: mtrl-th