Resumen
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.
| Idioma original | English |
|---|---|
| Páginas (desde-hasta) | 383-386 |
| Número de páginas | 4 |
| Publicación | Mathematics Magazine |
| Volumen | 94 |
| N.º | 5 |
| DOI | |
| Estado | Published - 2021 |
Nota bibliográfica
Publisher Copyright:©, Mathematical Association of America.
Financiación
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).
| Financiadores | Número del financiador |
|---|---|
| Simons Foundation | 429370 |
ASJC Scopus subject areas
- General Mathematics
Huella
Profundice en los temas de investigación de 'Bounding Monochromatic Triangles Using Squares'. En conjunto forman una huella única.Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver