The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs (Q6621215)
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 7928529
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs |
scientific article; zbMATH DE number 7928529 |
Statements
The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs (English)
0 references
18 October 2024
0 references
path
0 references
cycle
0 references
generalized Turán number
0 references
