Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph (Q2225397): Difference between revisions
From MaRDI portal
Latest revision as of 13:25, 24 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
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