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).
机构:S China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R China
Shan, ZL
Liu, BL
论文数: 0引用数: 0
h-index: 0
机构:
S China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R ChinaS China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R China