The maximum number of triangles in a \(K_4\)-free graph (Q1297475)
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: The maximum number of triangles in a K₄-free graph |
scientific article; zbMATH DE number 1321840
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum number of triangles in a \(K_4\)-free graph |
scientific article; zbMATH DE number 1321840 |
Statements
The maximum number of triangles in a \(K_4\)-free graph (English)
0 references
4 April 2000
0 references
clique number
0 references
Turán graph
0 references
\(K_4\)-free graphs
0 references
0 references
0.8154106140136719
0 references
0.7910692691802979
0 references
0.7908073663711548
0 references
0.7717337608337402
0 references
