Skip navigation
Skip navigation

Indivisible plexes in latin squares

Bryant, Darryn; Egan, Judith; Maenhaut, Barbara; Wanless, Ian


A k-plex is a selection of kn entries of a latin square of order n in which each row, column and symbol is represented precisely k times. A transversal of a latin square corresponds to the case k = 1. A k-plex is said to be indivisible if it contains no c-plex for any 0 < c < k. We prove that if n = 2km for integers k ≥ 2 and m ≥ 1 then there exists a latin square of order n composed of 2m disjoint indivisible k-plexes. Also, for positive integers k and n satisfying n = 3k, n = 4k or n ≥ 5k, we...[Show more]

CollectionsANU Research Publications
Date published: 2009
Type: Journal article
Source: Designs, Codes and Cryptography
DOI: 10.1007/s10623-009-9269-z


File Description SizeFormat Image
01_Bryant_Indivisible_plexes_in_latin_2009.pdf205.28 kBAdobe PDF    Request a copy
02_Bryant_Indivisible_plexes_in_latin_2009.pdf12.38 kBAdobe PDF    Request a copy

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator