摘 要:
在本文我们给出了一个新的定义C-圈.设f(n,k,r)是不含C-圈的n阶r-一致超图的最大可能边数,我们主要是确定f(n,k,r)或给出它的一个下界,另外,我们给出了超图不含C-圈的一个充分必要条件。[著者文摘]
文章出处:
《应用数学》-2006年19卷3期 -498-503页
Mathematica Applicata
分 类 号:
文献标识码:
A
文章编号:
1001-9847(2006)03-0498-06
[参考文献]
C-cycles in hypergraphs
LIN Qi-zhong ,DU Zhi-hua,LIU Jua (Department of Mathematics, Xinjiang Normal University ,Ururnqi 830054, China)
Abstract:
We give a new definition of C- cycle. Let f(n.k, r) be the maximum possible number of edges in a r-- uniform bypergrapb of order n which contains no k-C- cycle, we mainly determine f(n, k, r) or give a lower bound of it. Moreover, we obtain a necessary and sufficient condition of a bypergraph which contains no C- cycle.[著者文摘]
Key words:
Hypergraph; C- cycle; Star
收稿日期: 2005-09-20
基金资助:
Supported by the Key Subject Foundation of Xinjiang Normal University

更多评论>>文章评论
学术















cqvip.com