Berge cycles in non-uniform hypergraphs (Q783055)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7226043
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Berge cycles in non-uniform hypergraphs |
scientific article; zbMATH DE number 7226043 |
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.8619750142097473
0 references
0.8585321307182312
0 references
0.8547374606132507
0 references
0.8433437347412109
0 references
0.8380090594291687
0 references
