The counting series for (k+1)-uniform linear acyclic hypergraphs

被引:0
|
作者
SHAN Zhilong & LIU Bolian Department of Mathematics
Department of Computer Science
机构
基金
中国国家自然科学基金;
关键词
hypergraph; linear hypergraph; hypertree; bipartite tree; Polya’s Enumeration Theorem;
D O I
暂无
中图分类号
O157.5 [图论];
学科分类号
070104 ;
摘要
The explicit formula for (k+l)-uniform linear acyclic hypergraphs and the counting series for unlabeled (k +1)-uniform linear acyclic hypergraphs are obtained.
引用
收藏
页码:197 / 200
页数:4
相关论文
共 50 条
  • [1] The counting series for (k+1)-uniform linear acyclic hypergraphs
    Shan, ZL
    Liu, BL
    [J]. CHINESE SCIENCE BULLETIN, 2001, 46 (03): : 197 - 200
  • [2] The counting series for unlabeled linear acyclic hypergraphs
    Shan, ZL
    Liu, BL
    [J]. ARS COMBINATORIA, 2006, 78 : 225 - 235
  • [3] Counting acyclic hypergraphs
    王建方
    李海珠
    [J]. Science in China,Ser.A., 2001, Ser.A.2001 (02) - 224
  • [4] Counting acyclic hypergraphs
    王建方
    李海珠
    [J]. Science China Mathematics, 2001, (02) : 220 - 224
  • [5] Counting acyclic hypergraphs
    Wang, JF
    Li, HZ
    [J]. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 2001, 44 (02): : 220 - 224
  • [6] Counting acyclic hypergraphs
    Jianfang Wang
    Haizhu Li
    [J]. Science in China Series A: Mathematics, 2001, 44 : 220 - 224
  • [7] The counting lemma for regular k-uniform hypergraphs
    Nagle, B
    Rödl, V
    Schacht, M
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (02) : 113 - 179
  • [8] Perfect matching and Hamilton cycle decomposition of complete balanced (k+1)-partite k-uniform hypergraphs
    Zhang, Yi
    Lu, Mei
    Liu, Ke
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2020, 386
  • [9] Counting minimal transversals of β-acyclic hypergraphs
    Bergougnoux, Benjamin
    Capelli, Florent
    Kante, Mamadou Moustapha
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2019, 101 : 21 - 30
  • [10] On almost (k-1)-degenerate (k+1)-chromatic graphs and hypergraphs
    Kostochka, Alexandr V.
    [J]. DISCRETE MATHEMATICS, 2013, 313 (04) : 366 - 374