Edge disjoint monochromatic triangles in 2-colored graphs Original Research Article

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).