Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/13464

Title: A structural decomposition for hypergraphs
Authors: Cohen, David A.
Jeavons, Peter G.
Gyssens, Marc
Issue Date: 1994
Publisher: American Mathematical Society
Citation: Barcelo, Hélène; Kalai, Gil (Ed.). Jerusalem Combinatorics '93, p. 161-177
Series/Report no.: 178
Abstract: 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 cylicity 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 hypergraphs with a greatly simplified proof. For more general k-hinges we show that it is impossible to obtain more powerful decompositions. However, in this case there may be several possible decompositions which do not share any structural invariant. We therefore consider restrictions on k-hinges which are neccesary in order to guarantee this structural invariant.
URI: http://hdl.handle.net/1942/13464
DOI: 10.1090/conm/178
ISBN: 978-0-8218-0294-6 (p) and 978-0-8218-7769-2 (e)
ISSN: 0271-4132
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Article preprint224.32 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.