The number of triangles in a \(K_ 4\)-free graph (Q1112062)
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 number of triangles in a K_ 4-free graph |
scientific article; zbMATH DE number 4077262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of triangles in a \(K_ 4\)-free graph |
scientific article; zbMATH DE number 4077262 |
Statements
The number of triangles in a \(K_ 4\)-free graph (English)
0 references
1988
0 references
The author shows that if a graph with e edges contains no complete 4- graphs then it contains at most \((e/3)^{3/2}\) complete 3-graphs.
0 references
complete 3-graphs
0 references
