login
Maximal number of pairwise edge-disjoint monochromatic K_3's in a K_n for any 2-coloring of the edges of K_n.
1

%I #7 Jan 12 2016 04:02:20

%S 0,0,0,1,2,2,3,4,6

%N Maximal number of pairwise edge-disjoint monochromatic K_3's in a K_n for any 2-coloring of the edges of K_n.

%H P. Erdős et al., <a href="http://dx.doi.org/10.1016/S0012-365X(00)00312-5">Edge disjoint monochromatic triangles in 2-colored graphs</a>, Discrete Math., 231 (2001), 135-141.

%Y Cf. A001839.

%K nonn,more

%O 3,5

%A _N. J. A. Sloane_, Apr 06 2001