典型文献
Hypergraph Turán Numbers of Vertex Disjoint Cycles
文献摘要：
The Turán number of a k-uniform hypergraph H,denoted by exk(n;H),is the maximum number of edges in any k-uniform hypergraph F on n vertices which does not contain H as a subgraph.Let C(k)l denote the family of all k-uniform minimal cycles of length l,S(l 1,…,lr)denote the family of hypergraphs consisting of unions of r vertex disjoint minimal cycles of length l1,…,lr,respectively,and C(k)l)denote a k-uniform linear cycle of length l.We determine precisely exk(n;S(l 1,…,lr))and exk(n;C(k)l1,…,C(k)lr)for suffciently large n.Our results extend recent results of Fiiredi and Jiang who determined the Turán numbers for single k-uniform minimal cycles and linear cycles.
文献关键词：
中图分类号：
作者姓名：
Ran GU;Xue-liang LI;Yong-tang SHI
作者机构：
Center for Combinatorics and LPMC,Nankai University,Tianjin 300071,China
文献出处：
引用格式：
[1]Ran GU;Xue-liang LI;Yong-tang SHI-.Hypergraph Turán Numbers of Vertex Disjoint Cycles)[J].应用数学学报（英文版）,2022(01):229-234
A类：
Disjoint,exk,lr,suffciently,Fiiredi
B类：
Hypergraph,Tur,Numbers,Vertex,Cycles,uniform,denoted,by,maximum,edges,any,vertices,which,does,contain,as,subgraph,Let,family,all,minimal,cycles,length,hypergraphs,consisting,unions,vertex,disjoint,l1,respectively,linear,We,precisely,large,Our,results,extend,recent,Jiang,who,determined,numbers,single
AB值：
0.447648
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
