Given 12 red points on a circle , find the mininum value of $n$ such that there exists $n$ triangles whose vertex are the red points . Satisfies: every chord whose points are the red points is the edge of one of the $n$ triangles .
Source:
Tags: geometry, combinatorics proposed, combinatorics
Given 12 red points on a circle , find the mininum value of $n$ such that there exists $n$ triangles whose vertex are the red points . Satisfies: every chord whose points are the red points is the edge of one of the $n$ triangles .