An Extremal Graph in which the forced Triangles are all the same color. Call the number of red Monochromatic Forced Triangles and the number of blue Monochromatic Forced Triangles, then a blue-empty graph is an Extremal Graph with . For Even , a blue-empty graph can be achieved by coloring red two Complete Subgraphs of points (the Red Net method). There is no blue-empty coloring for Odd except for (Lorden 1962).
See also Complete Graph, Extremal Graph, Monochromatic Forced Triangle, Red Net
References
Lorden, G. ``Blue-Empty Chromatic Graphs.'' Amer. Math. Monthly 69, 114-120, 1962.
Sauvé, L. ``On Chromatic Graphs.'' Amer. Math. Monthly 68, 107-111, 1961.