Question 107
$2n-1$ rooks are placed on a $(2n-1) \times (2n-1)$ chessboard so that no two rooks are ever in the same row or the same column. Show that every $n \times n$ square contains a rook.
Math Olympiad Vault · MathNet 2024-part-02 — 168 problems (EN–VI)