A structural decomposition for hypergraphs
Peter Jeavons, David Cohen, Marc Gyssens · Contemporary mathematics - American Mathematical Society · 1994
. Hypergraphs arise in a variety of applications and are commonly classified as cyclic or acyclic. In this paper we develop a more refined classification scheme for cyclic hypergraphs based on a natural decomposition strategy. The fundamental building blocks in our decompositions are subsets of edges known as k-hinges. For any hypergraph, a set of more than k of its edges is defined to be a k-hinge if all connected components of the hypergraph with respect to the set of edges meet the latter within at most k of its edges. A k-hinge tree is a set of minimal k-hinges that cover all edges of H, and form a tree with respect to intersection. The size of the largest node in any 1-hinge tree is shown to be an invariant of the hypergraph, which we call the degree of cyclicity. Acyclic hypergraphs are hypergraphs with degree of cyclicity 2. The concept of degree of cyclicity was first presented by Gyssens in the context of relational database design, but is presented here for arbitrary hyperg...