Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph (Q2225397)
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 numbers of cliques and cycles of fixed size in an F-saturated graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph |
scientific article |
Statements
Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph (English)
0 references
8 February 2021
0 references
\(F\)-free graph
0 references
Turan number
0 references
0.8462426662445068
0 references
0.8428360223770142
0 references
0.8340148329734802
0 references
0.826945960521698
0 references
