A note on the maximum number of triangles in a \(C_5\)-free graph (Q1689946)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6827202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the maximum number of triangles in a \(C_5\)-free graph |
scientific article; zbMATH DE number 6827202 |
Statements
A note on the maximum number of triangles in a \(C_5\)-free graph (English)
0 references
18 January 2018
0 references
triangles
0 references
counting subgraphs
0 references
\(H\)-free graphs
0 references
Turán type
0 references
five cycle
0 references
0.9996561408042908
0 references
0.8530847430229187
0 references
0.843098521232605
0 references
0.8402015566825867
0 references
0.8138067722320557
0 references
