2013 OIM Problems/Problem 6

Revision as of 14:37, 14 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == A ''configuration'' is a finite set <math>S</math> of points in the plane between which there are no three collinear and each point is assigned some color, so if...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

A configuration is a finite set $S$ of points in the plane between which there are no three collinear and each point is assigned some color, so if a triangle whose vertices are in $S$ has an angle greater than or equal to $120^{\circ}$, then exactly two of its vertices are the same color.

Find the maximum number of points that a configuration can have.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions