Minimizing the number of 5-cycles in graphs with given edge-density (Q5222570)
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: Minimizing the number of 5-cycles in graphs with given edge-density |
scientific article; zbMATH DE number 7186376
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of 5-cycles in graphs with given edge-density |
scientific article; zbMATH DE number 7186376 |
Statements
Minimizing the number of 5-cycles in graphs with given edge-density (English)
0 references
6 April 2020
0 references
matching upper bound
0 references
balanced complete \(k\)-partite graph
0 references
0.8307808041572571
0 references
0.8119422197341919
0 references
0.7955840229988098
0 references
0.782970666885376
0 references
0.7812220454216003
0 references
