Hypergraph Turán Numbers of Vertex Disjoint Cycles

• 作者: Ran GU Xue-liang LI Yong-tang SHI
• 来源期刊: 应用数学学报（英文版）
• 年，卷（期）: 2022,（1）
• 页码范围: 229-234
• 页数: 6页
• 语种: 英文

摘要

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.