Counting acyclic hypergraphs |
| |
| Authors: | Wang Jianfang LI Haizhu |
| |
| Institution: | Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100080, China |
| |
| Abstract: | Acyclic hypergraphs are analogues of forests in graphs. They are very useful in the design of databases. The number of distinct
acyclic uniform hypergraphs withn labeled vertices is studied. With the aid of the principle of inclusion-exclusion, two formulas are presented. One is the
explicitformula for strict (d)-connected acyclic hypergraphs, the other is the recurrence formula for linear acyclic hypergraphs. |
| |
| Keywords: | acyclic hypergraph enumeration of acyclic hypergraphs |
| 本文献已被 万方数据 SpringerLink 等数据库收录！ |
|
