Summary: Goodman gave the lower bound on the number of monochromatic triangles of the complete graph on n vertices when the edges are colored with two colors. We reprove his result by giving an algebraic reformulation and utilizing that squares of real expressions are nonnegative.
Bibliographical noteFunding Information:
The author thanks the referee and the editor for suggestions improving the exposition and Theodore Ehrenborg for reading an earlier draft. This work was also partially supported by a grant from the Simons Foundation (#429370 to Richard Ehrenborg).
©, Mathematical Association of America.
ASJC Scopus subject areas
- Mathematics (all)