The problem of completing a partially specified n by n Latin square is solved by an alternative proof, based on filling the rows (or diagonals) from 1 to n, using an extended form of Hall's marriage theorem.
The de Bruijn-Erdös theorem in incidence geometry via Ph. Hall's marriage theorem
The meet operation in the imbalance lattice of maximal instantaneous codes: alternative proof of existence
Completing partial Latin squares with two filled rows and three filled columns
![QR code for arXiv:1605.05931 [math.CO]](http://oss.arxitics.com/images/favicon.svg)