Y by sami1618
In a complete graph with
vertices, each edge has one of the colors
,
, or
. For each
, if the
vertices can be divided into
groups such that any two vertices connected by an edge of color
are in different groups, find the minimum possible value of
.








