- Mathematics, Computer Science
- Published in Discrete Mathematics 2001
DOI:10.1016/S0012-365X(02)00599-X

# 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

## The Largest Critical Sets of Latin Squares

VIEW 3 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## Hardness of learning loops, monoids, and semirings

VIEW 1 EXCERPT

## The theory and application of latin bitrades: A survey

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-3 OF 3 REFERENCES