Spring 2017, problem 41

Let $G$ be a connected graph, with the degree of all vertices not less than $m \geq 3$ (that is the number of edges incoming to each vertex is not less than 3). Assume further 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.$

View comment thread