MathDB

6

Part of 1969 Swedish Mathematical Competition

Problems(1)

n triangles from 3n points in the plane

Source: 1969 Swedish Mathematical Competition p6

3/21/2021
Given 3n3n points in the plane, no three collinear, is it always possible to form nn triangles (with vertices at the points), so that no point in the plane lies in more than one triangle?
combinatorial geometrycombinatoricspointsTriangles