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.
| Original language | English (US) |
|---|---|
| Article number | P3.9 |
| Pages (from-to) | 1-13 |
| Number of pages | 13 |
| Journal | Electronic Journal of Combinatorics |
| Volume | 27 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2020 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics