Counting acyclic hypergraphs |
| |
| Authors: | Jianfang Wang Haizhu Li |
| |
| Institution: | 1. Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, 100080, Beijing, 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: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
