3-uniform hypergraphs without a cycle of length five (Q2182003)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 3-uniform hypergraphs without a cycle of length five |
scientific article |
Statements
3-uniform hypergraphs without a cycle of length five (English)
0 references
20 May 2020
0 references
The paper improves an earlier upper bound on the number of hyperedges in a 3-uniform hypergraph on \(n\) vertices without Berge cycles of length 5. The proof examines certain subgraphs of the shadow graph.
0 references
Berge cycle
0 references
maximum number of hyperedges
0 references
