The minimal critical-set bounds for powers of two
Statement
Let be the Latin square of order , with , and let be a critical set of minimal size in . Writing for this critical set, so that , the minimal critical-set bound conjecture.
These bounds are motivated by computational results for , , and and by the difficulty of determining optimal critical sets and unique completions. The source does not provide a resolution of the conjectured bound.
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.