Blue-Empty Graph

A blue-empty graph is 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).