Exact Turán numbers of two vertex-disjoint paths

Miao Dong, Bo Ning, Long-Tu Yuan +1

The Turán number of a graph $H$ is the maximum number of edges in any graph of order $n$ that does not contain $H$ as a subgraph. In 1959, Erd\H os and Gallai obtained a sharp uppe…