Counting acyclic hypergraphs

Authors
Citation
Jf. Wang et Hz. Li, Counting acyclic hypergraphs, SCI CHINA A, 44(2), 2001, pp. 220-224
Citations number
5
Categorie Soggetti
Multidisciplinary
Journal title
SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY
ISSN journal
10016511 → ACNP
Volume
44
Issue
2
Year of publication
2001
Pages
220 - 224
Database
ISI
SICI code
1001-6511(200102)44:2<220:CAH>2.0.ZU;2-W
Abstract
Acyclic hypergraphs are analogues of forests in graphs. They are very usefu l in the design of databases. The number of distinct acyclic uniform hyperg raphs with n labeled vertices is studied. With the aid of the principle of inclusion-exclusion, two formulas are presented. One is the explicit formul a for strict ( d)-connected acyclic hypergraphs, the other is the recurrenc e formula for linear acyclic hypergraphs.