The smallest critical set in an n x n Latin square
is scs(n) and the largest is lcs(n). It is conjectured
that scs(n) = floor(n^2/4) and
lcs(n) is less than or equal to (1-(3/4)^log2(n))*n^2.
Log in or register to write something here or to contact authors.
Need help? firstname.lastname@example.org