| Hypergraph Turán Numbers of Vertex Disjoint Cycles |
| |
| 作者姓名： | Ran GU Xue-liang LI Yong-tang SHI |
| |
| 作者单位： | Center for Combinatorics and LPMC, Nankai University |
| |
| 基金项目： | partially supported by the National Natural Science Foundation of China (Nos. 12131013,11871034);partially supported by the National Natural Science Foundation of China(Nos. 11922112, 12161141006)；;the Natural Science Foundation of Tianjin (Nos. 20JCZDJC00840,20JCJQJC00090)； |
| |
| 摘 要： | 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 Cl~((k)) denote the family of all k-uniform minimal cycles of length l;S(?1,…,?r) denote the family of hypergraphs consisting of unions of r vertex disjoint minimal cycles of length ?1,…?r,respectively,and Cl~((k))denote a k-uniform linear ...
|
| 本文献已被 SpringerLink 等数据库收录！ |
|
