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).
Schwenk's Formula
See also
Extremal Graph, Monochromatic Forced TriangleExplore with Wolfram|Alpha
References
Schwenk, A. J. "Acquaintance Party Problem." Amer. Math. Monthly 79, 1113-1117, 1972.Referenced on Wolfram|Alpha
Schwenk's FormulaCite this as:
Weisstein, Eric W. "Schwenk's Formula." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/SchwenksFormula.html