Title of article
Edge disjoint monochromatic triangles in 2-colored graphs Original Research Article
Author/Authors
P. Erd?s، نويسنده , , R.J. Faudree، نويسنده , , R.J. Gould، نويسنده , , M.S. Jacobson، نويسنده , , J. Lehel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
7
From page
135
To page
141
Abstract
Let N(n,k) be the minimum number of pairwise edge disjoint monochromatic complete graphs Kk in any 2-coloring of the edges of a Kn. Upper and lower bounds on N(n,k) will be given for k⩾3. For k=3, exact values will be given for n⩽11, and these will be used to give a lower bound for N(n,3).
Journal title
Discrete Mathematics
Serial Year
2001
Journal title
Discrete Mathematics
Record number
955269
Link To Document