The number of triangles in a \(K_ 4\)-free graph (Q1112062): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(88)90021-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2079412785 / rank | |||
Normal rank | |||
Latest revision as of 11:12, 30 July 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
