ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be an n×nn\times n partial Latin square of order nn, meaning that each cell contains at most one symbol from [n]={1,…,n}[n]=\{1,\dots,n\} and each symbol occurs at most once in every row and column. A completion of PP is an n×nn\times n Latin square agreeing with PP in every nonempty cell; PP is completable if it has a completion.

Kuhl–McGinn's conjecture. Every partial Latin square of order n≥8n\geq 8 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.