Enumeration of Maximum Acyclic Hypergraphs

被引:1
|
作者
Jian-fang Wang
机构
基金
中国国家自然科学基金;
关键词
Hypergraph; Acyclic hypergraph; Enumeration formula;
D O I
暂无
中图分类号
O157.5 [图论];
学科分类号
070104 ;
摘要
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 (~n)(n(r-1)-r~2+2r).
引用
收藏
页码:215 / 218
页数:4
相关论文
共 50 条