Completing Partial Latin Squares - Alternative Proof
arXiv:1605.05931
Abstract
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.
I found an error in the proof [case d=1]