min no of triangular faces of polyhedron with faces more numbered than vertices
Source: 1999 German Federal - Bundeswettbewerb Mathematik - BWM - Round 1 p4
January 27, 2020
combinatorial geometrygeometrycombinatorics
Problem Statement
It is known that there are polyhedrons whose faces are more numbered than the vertices. Find the smallest number of triangular faces that such a polyhedron can have.