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.
机构:
Moscow MV Lomonosov State Univ, Fac Mech & Math, Dept Probabil Theory, Moscow 119991, Russia
Moscow Inst Phys & Technol, Fac Innovat & High Technol, Dept Discrete Math, Dolgoprudnyi 141700, Moscow Region, RussiaMoscow MV Lomonosov State Univ, Fac Mech & Math, Dept Probabil Theory, Moscow 119991, Russia
机构:
Isfahan Univ Technol, Dept Math Sci, POB 84156-83111, Esfahan, IranIsfahan Univ Technol, Dept Math Sci, POB 84156-83111, Esfahan, Iran
Khodadadpour, Afsaneh
Omidi, Gholamreza
论文数: 0引用数: 0
h-index: 0
机构:
Isfahan Univ Technol, Dept Math Sci, POB 84156-83111, Esfahan, Iran
Inst Res Fundamental Sci IPM, Sch Math, POB 19395-5746, Tehran, IranIsfahan Univ Technol, Dept Math Sci, POB 84156-83111, Esfahan, Iran