Completing Partial Latin Squares - Alternative Proof
Combinatorics
2016-12-28 v2
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.
Cite
@article{arxiv.1605.05931,
title = {Completing Partial Latin Squares - Alternative Proof},
author = {Eli Shamir},
journal= {arXiv preprint arXiv:1605.05931},
year = {2016}
}
Comments
I found an error in the proof [case d=1]