Exact generalized Turán number of vertex-disjoint paths of length two

2026/07/20 by Qi Wu, Long-Tu Yuan
#math.CO

paper · pdf

Abstract

We determine the generalized Turán number of vertex-disjoint paths of length two and characterize all corresponding extremal graphs. Our proof combines the Lovász form of the Kruskal--Katona theorem with a discrete convexity argument.

Citations

• On cliques in graphs

Related

• Exact Turán numbers of two vertex-disjoint paths
• The Turan Number of Disjoint Copies of Paths
• Turán numbers for disjoint paths
• Generalized Turán problem for a path and a clique
• The Turán number of the square of a path