Problem

Source: X International Festival of Young Mathematicians Sozopol 2019, Theme for 10-12 grade

Tags: combinatorics, geometry, polyhedron



A convex polyhedron has $m$ triangular faces (there can be faces of other kind too). From each vertex there are exactly 4 edges. Find the least possible value of $m$.