Given an n-gon (n≥4), consider a set T of triangles formed by vertices of the polygon having the following property: Every two triangles in T have either two common vertices, or none. Prove that T contains at most n triangles. combinatorial geometrygeometryset