Completing simple partial k-Latin squares
DOI:
https://doi.org/10.1478/AAPP.96S2A4Parole chiave:
Simple k-Factorization, k-Factor, f-Factor, Multi-Latin Square, k- Latin Square, Completion, Generalized Latin RectanglesAbstract
We study the completion problem for simple k-Latin rectangles, which are a special case of the generalized latin rectangles studied for which embedding theorems are given by Andersen and Hilton (1980) in “Generalized Latin rectangles II: Embedding”, Discrete Mathematics 31(3). Here an alternative proof of those theorems are given for k-Latin rectangles in the “simple” case. More precisely, generalizing two classic results on the completability of partial Latin squares, we prove the necessary and suffisucient conditions for a completion of a simple m x n k-Latin rectangle to a simple k-Latin square of order n and we show that if m ≤ n/2, any simple partial k-Latin square P of order m embeds in a simple k-Latin square L of order n.Dowloads
Pubblicato
2018-11-20
Fascicolo
Sezione
HyGraDe 2017 (Conference Proceedings)
Licenza
This work is licensed under a Creative Commons Attribution 4.0 International License.
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
