The number of triangles in a \(K_ 4\)-free graph (Q1112062): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:14, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of triangles in a \(K_ 4\)-free graph |
scientific article |
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
