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.

0, 0, 0, 1, 2, 2, 3, 4, 6

Offset: 3

Author

N. J. A. Sloane, Apr 06 2001

Keywords

• nonn
• more

Links

• P. Erdős et al., Edge disjoint monochromatic triangles in 2-colored graphs, Discrete Math., 231 (2001), 135-141.

Crossrefs

Cf. A001839.