Berge cycles in non-uniform hypergraphs

被引：3
|
作者：
Furedi, Zoltan [1 ]
Kostochka, Alexandr [2 ]
Luo, Ruth [3 ]
机构：
[1] Alfred Renyi Inst Math, Budapest, Hungary
[2] Univ Illinois, Dept Math, Urbana, IL USA
[3] Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA
来源：
ELECTRONIC JOURNAL OF COMBINATORICS | 2020年 / 27卷 / 03期
基金：
俄罗斯基础研究基金会;
关键词：
GRAPHS;
D O I：
10.37236/9346
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We consider two extremal problems for set systems without long Berge cycles. First we give Dirac-type minimum degree conditions that force long Berge cycles. Next we give an upper bound for the number of hyperedges in a hypergraph with bounded circumference. Both results are best possible in infinitely many cases.
引用
收藏
页码：1 / 13
页数：13
相关论文
共 50 条
  • [1] Turan problems on Non-uniform Hypergraphs
    Johnston, J. Travis
    Lu, Linyuan
    ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (04):
  • [2] Self-Complementary Non-Uniform Hypergraphs
    Gosselin, Shonda
    GRAPHS AND COMBINATORICS, 2012, 28 (05) : 615 - 635
  • [3] On Motzkin-Straus type results for non-uniform hypergraphs
    Tang, Qingsong
    Peng, Yuejian
    Zhang, Xiangde
    Zhao, Cheng
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (02) : 504 - 521
  • [4] Some Motzkin-Straus type results for non-uniform hypergraphs
    Gu, Ran
    Li, Xueliang
    Peng, Yuejian
    Shi, Yongtang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (01) : 223 - 238
  • [5] Rainbow Hamilton cycles in uniform hypergraphs
    Dudek, Andrzej
    Frieze, Alan
    Rucinski, Andrzej
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (01):
  • [6] Forbidden Berge hypergraphs
    Anstee, R. P.
    Salazar, Santiago
    ELECTRONIC JOURNAL OF COMBINATORICS, 2017, 24 (01):
  • [7] On r-uniform linear hypergraphs with no Berge-K2,t
    Timmons, Craig
    ELECTRONIC JOURNAL OF COMBINATORICS, 2017, 24 (04):
  • [8] Packing tight Hamilton cycles in 3-uniform hypergraphs
    Frieze, Alan
    Krivelevich, Michael
    Loh, Po-Shen
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 913 - 932
  • [9] Packing tight Hamilton cycles in 3-uniform hypergraphs
    Frieze, Alan
    Krivelevich, Michael
    Loh, Po-Shen
    RANDOM STRUCTURES & ALGORITHMS, 2012, 40 (03) : 269 - 300
  • [10] Asymptotics for Turan numbers of cycles in 3-uniform linear hypergraphs
    Ergemlidze, Beka
    Gyori, Ervin
    Methuku, Abhishek
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2019, 163 : 163 - 181
12345