Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7599
Title: A Lower Bound for the Size of the Largest Critical Sets in Latin Squares
Authors: Hamed Hatami
Ebadollah S. Mahmoodian
Issue Date: 2003
Publisher: Bulletin of the Institute of Combinatorics and Its Applications
Abstract: 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). We give a lower bound for lcs(n) by showing that lcs(n) ≥ n2(1 _ 2+ln 2/In n) + n( l + ln(8π)/In n) -ln2/Inn
URI: http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7599
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
A lower bound for the size of the.pdf
  Restricted Access
1.71 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.