| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651678 | Electronic Notes in Discrete Mathematics | 2015 | 6 Pages |
Abstract
The Turán 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 P3 denote a path on 3 vertices, and kP3 denote k vertex-disjoint copies of P3. We determine ex(n,kP3) for all n and k proving a conjecture of Gorgol.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
