On the Number of 4-Edge Paths in Graphs With Given Edge Density (Q5366950)
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: On the Number of 4-Edge Paths in Graphs With Given Edge Density |
scientific article; zbMATH DE number 6788956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Number of 4-Edge Paths in Graphs With Given Edge Density |
scientific article; zbMATH DE number 6788956 |
Statements
On the Number of 4-Edge Paths in Graphs With Given Edge Density (English)
0 references
10 October 2017
0 references
\(k\)-edge stars
0 references
quasi-star
0 references
quasi-clique graph
0 references
0.92466503
0 references
0.9110503
0 references
0.9106913
0 references
0.89880145
0 references
0.8956525
0 references
0.8892716
0 references
0.88581836
0 references
0.8762445
0 references
