Uniqueness of non-completable latin square of size $n$

37 Views Asked by At

It is known that partial latin squares of order $n$ and size $n-1$ can always be completed to a latin square. I want to know if non-completable partial latin squares of order $n$, size $n$ satisfy this property:

  • There exists $n-1$ entries with the same row, column, or color.

Is this a known result or maybe a false statement? If not, would it be decent for a research topic?