2004 Combinatorics #7
Source:
December 31, 2011
geometry3D geometrytetrahedrongraph theory
Problem Statement
We have a polyhedron such that an ant can walk from one vertex to another, traveling only along edges, and traversing every edge exactly once. What is the smallest possible total number of vertices, edges, and faces of this polyhedron?