A new bound on the size of the largest critical set in a Latin square
| dc.creator | Bean, Richard | |
| dc.creator | Mahmoodian, E. S. | |
| dc.date | 2001-07-23 | |
| dc.date.accessioned | 2026-07-07T04:42:41Z | |
| dc.date.available | 2026-07-07T04:42:41Z | |
| dc.description | A critical set in an n x n array is a set C of given entries, such that there exists a unique extension of C to an n x n 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) <= n^2 - n. Here we show that lcs(n) <= n^2-3n+3. | |
| dc.description | 10 pages, LaTeX | |
| dc.identifier | https://arxiv.org/abs/math/0107159 | |
| dc.identifier | http://arxiv.org/abs/math/0107159 | |
| dc.identifier | Discrete Math. 267 (2003) 13-21 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/61885 | |
| dc.subject | Combinatorics | |
| dc.subject | 05B15 | |
| dc.title | A new bound on the size of the largest critical set in a Latin square | |
| dc.type | text |