The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs

MaRDI QIDQ6621215

Casey Tompkins, Oscar Zamora, Ervin Gyoeri, Nika Salia

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

zbMATH Keywords

cyclepathgeneralized Turán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites Work

• Pentagons vs. triangles
• Connected graphs without long paths
• The spectral radius of graphs without paths and cycles of specified length
• On the number of subgraphs of prescribed type of graphs with a given number of edges
• The maximum number of cliques in graphs without long cycles
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• On maximal paths and circuits of graphs
• Some Theorems on Abstract Graphs
• Many \(T\) copies in \(H\)-free graphs

Related Items (1)

On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph

This page was built for publication: The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs