Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T02:23:43.833Z Has data issue: false hasContentIssue false

Triangles in a complete chromatic graph

Part of:Graph theory

Published online by Cambridge University Press:  09 April 2009

A. W. Goodman
Affiliation:
Department of MathematicsUniversity of South FloridaTampa, Florida 33620, U.S.A.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Suppose that in a complete graph on N points, each edge is given arbitrarily either the color red or the color blue, but the total number of blue edges is fixed at T. We find the minimum number of monochromatic triangles in the graph as a function of N and T. The maximum number of monochromatic triangles presents a more difficult problem. Here we propose a reasonable conjecture supported by examples.

MSC classification

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1985