Nelder’s minimum critical-set conjecture
For every integer , let be the set of Latin squares of order . A critical set of is a set of entries of such that is the unique Latin square of order containing , while no proper subset of has this property. Then
References
- A counting proof for the smallest critical set in a Latin square — arXiv — Richard Bean
Source: arXiv
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.