Some of the $n$ faces of a polyhedron are colored in black such that any two black-colored faces have no common vertex. The rest of the faces of the polyhedron are colored in white. Prove that the number of common sides of two white-colored faces of the polyhedron is at least $n-2$.
Problem
Source: Romanian ROM TST 2004, problem 15, created by Calin Popescu
Tags: Euler, combinatorics solved, combinatorics