← All problems

Nelder’s minimum critical-set conjecture

For every integer n≥1n\ge 1, let Ln\mathcal{L}_n be the set of Latin squares of order nn. A critical set of L∈LnL\in\mathcal{L}_n is a set CC of entries of LL such that LL is the unique Latin square of order nn containing CC, while no proper subset of CC has this property. Then

min⁡L∈Ln  min⁡{∣C∣:C is a critical set of L}=⌊n24⌋.\min_{L\in\mathcal{L}_n}\;\min\{\lvert C\rvert:C\text{ is a critical set of }L\}=\left\lfloor\frac{n^2}{4}\right\rfloor.
References

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.