The maximum number of $P_\ell$ copies in $P_k$-free graphs
From MaRDI portal
Publication:5226834
zbMath1417.05106arXiv1803.03240MaRDI QIDQ5226834
Casey Tompkins, Nika Salia, Oscar Zamora, Ervin Gyoeri
Publication date: 1 August 2019
Full work available at URL: https://arxiv.org/abs/1803.03240
Related Items (16)
Subgraph densities in a surface ⋮ Tree densities in sparse graph classes ⋮ Some exact results for generalized Turán problems ⋮ Ordering \(Q\)-indices of graphs: given size and circumference ⋮ The maximum number of paths of length three in a planar graph ⋮ The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ Stability version of Dirac's theorem and its applications for generalized Turán problems ⋮ Random polynomial graphs for random Turán problems ⋮ Generalized Turán problems for even cycles ⋮ The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths ⋮ Many H-Copies in Graphs with a Forbidden Tree ⋮ Some results on \(k\)-Turán-good graphs ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ The maximum number of stars in a graph without linear forest ⋮ Further results on the generalized Turán number of spanning linear forests ⋮ Supersaturation for subgraph counts
This page was built for publication: The maximum number of $P_\ell$ copies in $P_k$-free graphs
