Berge cycles in non-uniform hypergraphs (Q783055)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Berge cycles in non-uniform hypergraphs |
scientific article |
Statements
Berge cycles in non-uniform hypergraphs (English)
0 references
30 July 2020
0 references
Summary: 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.
0 references
set systems without long Berge cycles
0 references
Dirac-type minimum degree conditions
0 references
0 references
