FKMO 2016 Problem 6
Let be a set of triangles. Prove that there exists a subset of which satisfies the following.
(i). The number of triangles in is at least (ii) There are no points such that triangles , , , , , are all in .
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.