Given a Complete Graph which is two-colored, the number of forced monochromatic Triangles is at least

The first few numbers of monochromatic forced triangles are 0, 0, 0, 0, 0, 2, 4, 8, 12, 20, 28, 40, ... (Sloane's A014557).

**References**

Goodman, A. W. ``On Sets of Acquaintances and Strangers at Any Party.'' *Amer. Math. Monthly* **66**, 778-783, 1959.

Sloane, N. J. A. Sequence A014557 in ``The On-Line Version of the Encyclopedia of Integer Sequences.'' http://www.research.att.com/~njas/sequences/eisonline.html.

© 1996-9

1999-05-26