Title of article
A density Corrلdi-Hajnal theorem
Author/Authors
Allen، نويسنده , , Peter and Bِttcher، نويسنده , , Julia and Hladk، نويسنده , , Jan and Piguet، نويسنده , , Diana، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
6
From page
31
To page
36
Abstract
For n sufficiently large, we determine the density threshold for an n-vertex graph to contain k vertex-disjoint triangles, where 0 ⩽ k ⩽ n 3 . This extends results by Erdős and by Moon, and can be viewed as a density version of the Corrádi-Hajnal theorem.
Keywords
Mantel?s theorem , Corr?di-Hajnal theorem , extremal graph theory , tiling problems
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2011
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455754
Link To Document