Given a complete graph 
which is two-colored, the number of forced monochromatic
triangles is at least
 |
(1)
|
The first few numbers of monochromatic forced triangles are 0, 0, 0, 0, 0, 2, 4, 8, 12, 20, 28, 40, ... (OEIS A014557).
Monochromatic Forced Triangle
See also
Complete Graph, Extremal GraphExplore with Wolfram|Alpha
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 Encyclopedia of Integer Sequences."Referenced on Wolfram|Alpha
Monochromatic Forced TriangleCite this as:
Weisstein, Eric W. "Monochromatic Forced Triangle." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MonochromaticForcedTriangle.html