A Lower Bound for the Size of the Largest Critical Sets in Latin Squares

Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7599

Full metadata record

DC Field	Value	Language
dc.contributor.author	Hamed Hatami	-
dc.contributor.author	Ebadollah S. Mahmoodian	-
dc.date.accessioned	2024-02-27T06:20:29Z	-
dc.date.available	2024-02-27T06:20:29Z	-
dc.date.issued	2003	-
dc.identifier.uri	http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7599	-
dc.description.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	-
dc.publisher	Bulletin of the Institute of Combinatorics and Its Applications	-
dc.title	A Lower Bound for the Size of the Largest Critical Sets in Latin Squares	-
dc.vol	Vol 38	-
Appears in Collections:	Articles to be qced

Files in This Item:

File	Size	Format
A lower bound for the size of the.pdf Restricted Access	1.71 MB	Adobe PDF	View/Open Request a copy

Alliance University, Bengaluru