Berge Cycles in Non-Uniform Hypergraphs

  • Zoltán Füredi
  • Alexandr Kostochka
  • Ruth Luo

Abstract

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.

Published
2020-07-24
Article Number
P3.9