| Enumeration of Maximum Acyclic Hypergraphs |
| |
| 作者姓名： | Jian-fang Wang Hai-zhu LiInstitute of Applied Mathematics Academy of Mathematics and System Sciences Chinese Academy of Sciences Beijing China |
| |
| 作者单位： | Jian-fang Wang，Hai-zhu LiInstitute of Applied Mathematics，Academy of Mathematics and System Sciences，Chinese Academy of Sciences，Beijing 100080，China |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China (No.19831080) |
| |
| 摘 要： | Abstract Acyclic hypergraphs are analogues of forests in graphs.They are very useful in the design ofdatabases. In this article,the maximum size of an acvclic hypergraph is determined and the number of maximumγ-uniform acyclic hypergraphs of order n is shown to be (_(r-1)~n)(n(r-1)-r~2 2r)~(n-r-1).
|
Enumeration of Maximum Acyclic Hypergraphs |
| |
| Jian-fang Wang,Hai-zhu LiInstitute of Applied Mathematics,Academy of Mathematics and System Sciences,Chinese Academy of Sciences,Beijing ,China.Enumeration of Maximum Acyclic Hypergraphs[J].Acta Mathematicae Applicatae Sinica,2002,18(2):215-218. |
| |
| Authors: | Jian-fang Wang Hai-zhu Li |
| |
| Institution: | (1) Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100080, China (E-mail: wjf@amath8.amt.ac.cn), CN |
| |
| Abstract: | |
| |
| Keywords: | Hypergraph Acyclic hypergraph Enumeration formula |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
