A point $latex P$ in the interior of a convex polyhedron in Euclidean space is called a pivot point of the polyhedron if every line through $latex P$ contains exactly $latex 0$ or $latex 2$ vertices of the polyhedron. Determine, with proof, the maximum number of pivot points that a polyhedron can contain.

Due to March 15, 2017