MathDB
Path from sides [Iran TST 2010]

Source:

May 10, 2010
geometryinductioncombinatorics

Problem Statement

In every 1×11\times1 square of an m×nm\times n table we have drawn one of two diagonals. Prove that there is a path including these diagonals either from left side to the right side, or from the upper side to the lower side.