The maximum number of $P_\ell$ copies in $P_k$-free graphs (Q5226834)
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: The maximum number of P_\ell copies in P_k-free graphs |
scientific article; zbMATH DE number 7088241
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum number of $P_\ell$ copies in $P_k$-free graphs |
scientific article; zbMATH DE number 7088241 |
Statements
1 August 2019
0 references
path
0 references
cycle
0 references
extremal
0 references
generalized Turán
0 references
math.CO
0 references
0.8359560966491699
0 references
0.8229294419288635
0 references
0.8199412226676941
0 references
0.7972317337989807
0 references
0.7950099110603333
0 references
