Berge cycles in non-uniform hypergraphs
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:IRT4KYFFrecord.jsonopen to challenge →
classification
math.CO
keywords
bergecyclesgivelongbestboundboundedcases
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.