KöMaL 2005 B3807
The degree of each vertex of a graph is equal to 3 and it is also given that the graph does not contain cycles whose length is less than 6. Find the lowest possible number of vertices in such a graph.
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.