3-uniform hypergraphs without a cycle of length five (Q2182003)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 3-uniform hypergraphs without a cycle of length five |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9528508
0 references
0.9259883
0 references
0 references
0.89617735
0 references
0.88621765
0 references
0.88621765
0 references
0.8719492
0 references
0.8654444
0 references
