A new bound on the size of the largest critical set in a Latin square

@article{Bean2001ANB,
  title={A new bound on the size of the largest critical set in a Latin square},
  author={Richard Bean and Ebadollah S. Mahmoodian},
  journal={Discrete Mathematics},
  year={2001},
  volume={267},
  pages={13-21}
}
A critical set in an nxn array is a set C of given entries, such that there exists a unique extension of C to an nxn Latin square and no proper subset of C has this property. The cardinality of the largest critical set in any Latin square of order n is denoted by lcs(n). In 1978, Curran and van Rees proved that lcs(n)= 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-5 OF 5 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-3 OF 3 REFERENCES

A discussion of Latin interchanges

Chin-Mei Fu, Hung-Lin Fu, Wen-Bin Liao
  • J . Combin . Math . Combin . Comput .
  • 1997

A new construction for a critical set in special Latin squares

K. Heinrich, W. D. Wallis
  • Proceedings of the Twenty - sixth Southeastern International Conference on Combinatorics , Graph Theory and Computing
  • 1995