The number of triangles in a \(K_ 4\)-free graph (Q1112062): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3852212 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5724802 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5721211 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3936767 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangles in an Ordinary Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the theory of graphs / rank | |||
Normal rank | |||
Revision as of 10:03, 19 June 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
