Prove that if we erase n−3 diagonals of a regular n-gon, then we may still choose n−3 of the remaining diagonals such that they don't intersect inside the n-gon; but it is possible to erase n−2 diagonals such that this statement doesn't hold. combinatorics unsolvedcombinatorics