MathDB
ASU 176 All Soviet Union MO 1973 arrows between n points

Source:

July 4, 2019
combinatorial geometry

Problem Statement

Given nn points, n>4n > 4. Prove that tou can connect them with arrows, in such a way, that you can reach every point from every other point, having passed through one or two arrows. (You can connect every pair with one arrow only, and move along the arrow in one direction only.)