KURSCHAK 1948 Problem 2
A convex polyhedron has no diagonals (every pair of vertices are connected by an edge). Prove that it is a tetrahedron.
Dataset text AI-MO AoPS. 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.