| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6423785 | Electronic Notes in Discrete Mathematics | 2011 | 6 Pages |
Abstract
For n sufficiently large, we determine the density threshold for an n-vertex graph to contain k vertex-disjoint triangles, where 0⩽k⩽n3. This extends results by ErdÅs and by Moon, and can be viewed as a density version of the Corrádi-Hajnal theorem.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet,