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.
| Original language | English |
|---|---|
| Pages (from-to) | 383-386 |
| Number of pages | 4 |
| Journal | Mathematics Magazine |
| Volume | 94 |
| Issue number | 5 |
| DOIs | |
| State | Published - 2021 |
Bibliographical note
Publisher Copyright:©, Mathematical Association of America.
ASJC Scopus subject areas
- General Mathematics