KöMaL 2009 B4218
In a graph, no vertex is connected to all of the others. For any pair of vertices not connected there is a vertex adjacent to both. The sum of the squares of the degrees of vertices is where is the number of vertices. What is the length of the shortest possible circuit in the 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.