A convex polyhedron has $2n$ faces ($n\ge 3$), and all faces are triangles. What is the largest number of vertices at which converges exactly $3$ edges at a such a polyhedron ?
Problem
Source: - All-Russian MO 2006 Regional (R4) 10.8
Tags: combinatorics, combinatorial geometry, geometry, 3D geometry, polyhedron