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,5

Links

Table of n, a(n) for n=3..11.

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

Crossrefs

Cf. A001839.

Sequence in context: A263140 A205006 A123560 * A083702 A074077 A078381

Adjacent sequences: A060404 A060405 A060406 * A060408 A060409 A060410

Keyword

nonn,more

Author

N. J. A. Sloane, Apr 06 2001

Status

approved