An analogue of Ryser's theorem for partial Sudoku squares
From MaRDI portal
Publication:2895331
Abstract: In 1956 Ryser gave a necessary and sufficient condition for a partial latin rectangle to be completable to a latin square. In 1990 Hilton and Johnson showed that Ryser's condition could be reformulated in terms of Hall's Condition for partial latin squares. Thus Ryser's Theorem can be interpreted as saying that any partial latin rectangle can be completed if and only if satisfies Hall's Condition for partial latin squares. We define Hall's Condition for partial Sudoku squares and show that Hall's Condition for partial Sudoku squares gives a criterion for the completion of partial Sudoku rectangles that is both necessary and sufficient. In the particular case where , , , the result is especially simple, as we show that any partial -Sudoku rectangle can be completed (no further condition being necessary).
Recommendations
Cited in
(7)- Ryser's theorem for \(\rho\)-Latin rectangles
- scientific article; zbMATH DE number 5251073 (Why is no real title available?)
- scientific article; zbMATH DE number 5356325 (Why is no real title available?)
- Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
- Spectrum of free-form Sudoku graphs
- Division sudokus: invariants, enumeration, and multiple partitions
- Hall's theorem and extending partial Latinized rectangles
This page was built for publication: An analogue of Ryser's theorem for partial Sudoku squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895331)