A note on the Turan number of a Berge odd cycle

被引：0
|
作者：
Gerener, Daniel [1 ]
机构：
[1] Hungarian Acad Sci, Alfred Renyi Inst Math, POB 127, H-1364 Budapest, Hungary
来源：
AUSTRALASIAN JOURNAL OF COMBINATORICS | 2021年 / 79卷
关键词：
3-UNIFORM HYPERGRAPHS; MAXIMUM NUMBER;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this note we obtain upper bounds on the number of hyperedges in 3-uniform hypergraphs not containing a Berge cycle of given odd length. We improve the bound given by Furedi and Ozkahya in 2017. The result follows from a more general theorem. We also obtain some new results for Berge cliques.
引用
收藏
页码：205 / 214
页数：10
相关论文
共 50 条
12345