Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7610
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNicholas J. Cavenagh-
dc.date.accessioned2024-02-27T06:20:31Z-
dc.date.available2024-02-27T06:20:31Z-
dc.date.issued2003-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7610-
dc.description.abstractDrapal and Kepka (1989) proved that if I is a latin trade in the back circulant latin squa re of order n , then III 2: O(logo), where p is the smallest prime that divides n. We give a n alternative proof of this result-
dc.publisherBulletin of the Institute of Combinatorics and Its Applications-
dc.titleThe Size of the Smallest Latin Trade In a Back Circulant Latin Square-
dc.volVol 38-
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
The size of the smallest latin trade 1n a back.pdf
  Restricted Access
1.78 MBAdobe PDFView/Open Request a copy


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