Sign in
Back
Constrained completion of partial latin squares
Journal article   Peer reviewed

Constrained completion of partial latin squares

Jaromy Kuhl and Tristan Denley
Discrete Mathematics, Vol.312, pp.1251-1256
312
2011
DOI: https://doi.org/10.1016/j.disc.2011.10.025
Web of Science ID: WOS:000300811200023

Metrics

128 Record Views
4 Times Cited - Web of Science

Abstract

In this paper, we combine the notions of completing and avoiding partial latin squares. Let P be a partial latin square of order n and let 𝑄 be the set of partial latin squares of order n that avoid P. We say that P is Q-completable if P can be completed to a latin square that avoids Q ∈ 𝑄. We prove that if P has order 4t and contains at most t − 1 entries, then P is Q-completable for each Q ∈ 𝑄 when t ≥ 9.

Details

Logo image