cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A060407 #7 Jan 12 2016 04:02:20
%S A060407 0,0,0,1,2,2,3,4,6
%N A060407 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 A060407 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 A060407 Cf. A001839.
%K A060407 nonn,more
%O A060407 3,5
%A A060407 _N. J. A. Sloane_, Apr 06 2001