Schwenk's formula counts monochromatic forced triangles in an extremal graph. Let
be the number of monochromatic
forced triangles (where 
and 
are the number of red and blue triangles)
in an extremal graph. Then
 |
where 
is a binomial coefficient and 
is the floor function
(Schwenk 1972).
