OBM 1981 Problem 4
A graph has points. Given any four points, there is one joined to the other three. Show that one point must be joined to all other points. What is the smallest number possible of such points (that are joined to all the others)?
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.