Paths of Length Three are $K_{r+1}$-Tur\'an Good

TL;DR

This paper proves that the path of length three, $P_3$, is $K_{r+1}$-Turán-good for all $r \,\geq\, 3$, extending previous results about shorter paths using flag algebra techniques.

Contribution

It establishes that $P_3$ is $K_{r+1}$-Turán-good for all $r \,\geq\, 3$, confirming a conjecture for longer paths with advanced algebraic methods.

Findings

$P_3$ is $K_{r+1}$-Turán-good for all $r \,\geq\, 3$

Uses flag algebra techniques for proof

Extends known results from shorter paths

Abstract

The generalized Tur\'an problem $ext(n,T,F)$ is to determine the maximal number of copies of a graph $T$ that can exist in an $F$-free graph on $n$ vertices. Recently, Gerbner and Palmer noted that the solution to the generalized Tur\'an problem is often the original Tur\'an graph. They gave the name "$F$-Tur\'an-good" to graphs $T$ for which, for large enough $n$, the solution to the generalized Tur\'an problem is realized by a Tur\'an graph. They prove that the path graph on two edges, $P_2$, is $K_{r+1}$-Tur\'an-good for all $r \ge 3$, but they conjecture that the same result should hold for all $P_\ell$. In this paper, using arguments based in flag algebras, we prove that the path on three edges, $P_3$, is also $K_{r+1}$-Tur\'an-good for all $r \ge 3$.