Problem

Source:

Tags: pigeonhole principle, graph theory, combinatorics proposed, combinatorics



Let $G$ be a connected graph, with degree of all vertices not less then $m \geq 3$, such that there is no path through all vertices of $G$ being in every vertex exactly once. Find the least possible number of vertices of $G.$