Enumeration of Maximum Acyclic Hypergraphs

被引：1
|
作者：
Jian-fang Wang
机构：
来源：
Acta Mathematicae Applicatae Sinica(English Series) | 2002年 / 02期
基金：
中国国家自然科学基金;
关键词：
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 条
  • [1] Enumeration of maximum acyclic hypergraphs
    Wang J.-F.
    Li H.-Z.
    Acta Mathematicae Applicatae Sinica, 2002, 18 (2) : 215 - 218
  • [2] ENUMERATION OF HYPERGRAPHS
    HEGDE, M
    SRIDHARAN, MR
    DISCRETE MATHEMATICS, 1983, 45 (2-3) : 239 - 243
  • [3] Enumeration of hypergraphs
    Ishihara, T
    EUROPEAN JOURNAL OF COMBINATORICS, 2001, 22 (04) : 503 - 509
  • [4] Counting acyclic hypergraphs
    王建方
    李海珠
    ScienceinChina,SerA., 2001, Ser.A.2001 (02) : 220 - 224
  • [5] Counting acyclic hypergraphs
    王建方
    李海珠
    Science China Mathematics, 2001, (02) : 220 - 224
  • [6] Counting acyclic hypergraphs
    Wang, JF
    Li, HZ
    SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 2001, 44 (02): : 220 - 224
  • [7] ON ACYCLIC AND CYCLIC HYPERGRAPHS
    LI Haizhu WANG Jianfang(Institute of Applied Mathematics
    Journal of Systems Science & Complexity, 2002, (04) : 353 - 362
  • [8] ON ACYCLIC AND CYCLIC HYPERGRAPHS
    LI Haizhu WANG JianfangInstitute of Applied Mathematics Academy of Mathematics and Systems Science Chinese Academyof Sciences Beijing China
    Journal of Systems Science and Complexity, 2002, (04) : 353 - 362
  • [9] CONNECTIONS IN ACYCLIC HYPERGRAPHS
    MAIER, D
    ULLMAN, JD
    THEORETICAL COMPUTER SCIENCE, 1984, 32 (1-2) : 185 - 199
  • [10] Counting acyclic hypergraphs
    Jianfang Wang
    Haizhu Li
    Science in China Series A: Mathematics, 2001, 44 : 220 - 224
12345