Kuhl–McGinn's completion conjecture for partial Latin squares with two rows and three columns
Statement
Let be an partial Latin square of order , meaning that each cell contains at most one symbol from and each symbol occurs at most once in every row and column. A completion of is an Latin square agreeing with in every nonempty cell; is completable if it has a completion.
Kuhl–McGinn's conjecture. Every partial Latin square of order with two completely filled rows and three completely filled columns, and with all other cells empty, is completable.
This is a completion problem for a structured family of partial Latin squares. The conjecture is presented as arising from Kuhl and McGinn's work; the supplied text gives no evidence of a resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.