The Turan Number of Disjoint Copies of Paths

Long-Tu Yuan, Xiao-Dong Zhang

The Turán number of a graph $H$, $ex(n,H)$, is the maximum number of edges in a simple graph of order $n$ which does not contain $H$ as a subgraph. Let $k\cdot P_3$ denote $k$ disj…