A Proof for a Conjecture of Gorgol

Abstract The Turan number of a graph H, ex ( n , H ) , is the maximum number of edges in any graph on n vertices which does not contain H as a subgraph. Let P 3 denote a path on 3 vertices, and k P 3 denote k vertex-disjoint copies of P 3 . We determine ex ( n , k P 3 ) for all n and k proving a conjecture of Gorgol.