Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/13464
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCohen, David A.-
dc.contributor.authorJeavons, Peter G.-
dc.contributor.authorGYSSENS, Marc-
dc.date.accessioned2012-03-21T15:11:19Z-
dc.date.available2012-03-21T15:11:19Z-
dc.date.issued1994-
dc.identifier.citationBarcelo, Hélène; Kalai, Gil (Ed.). Jerusalem Combinatorics '93, p. 161-177-
dc.identifier.isbn978-0-8218-0294-6 (p) and 978-0-8218-7769-2 (e)-
dc.identifier.issn0271-4132-
dc.identifier.urihttp://hdl.handle.net/1942/13464-
dc.description.abstractHypergraphs 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.-
dc.language.isoen-
dc.publisherAmerican Mathematical Society-
dc.relation.ispartofseriesCONTEMPORARY MATHEMATICS-
dc.rightsCopyright 1994 American Mathematical Society-
dc.titleA structural decomposition for hypergraphs-
dc.typeProceedings Paper-
local.bibliographicCitation.authorsBarcelo, Hélène-
local.bibliographicCitation.authorsKalai, Gil-
local.bibliographicCitation.conferencedate9-17 May 1993-
local.bibliographicCitation.conferencenameJerusalem Combinatorics '93-
local.bibliographicCitation.conferenceplaceJerusalem, Israel-
dc.identifier.epage177-
dc.identifier.spage161-
local.type.refereedRefereed-
local.type.specifiedArticle-
local.relation.ispartofseriesnr178-
dc.bibliographicCitation.oldjcatC2-
dc.identifier.doi10.1090/conm/178-
local.bibliographicCitation.btitleJerusalem Combinatorics '93-
item.contributorJeavons, Peter G.-
item.contributorCohen, David A.-
item.contributorGYSSENS, Marc-
item.accessRightsOpen Access-
item.fullcitationCohen, David A.; Jeavons, Peter G. & GYSSENS, Marc (1994) A structural decomposition for hypergraphs. In: Barcelo, Hélène; Kalai, Gil (Ed.). Jerusalem Combinatorics '93, p. 161-177.-
item.fulltextWith Fulltext-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
10.1.1.43.8725[1].pdfArticle preprint224.32 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check

Altmetric


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