Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call