Further Results on Latin Squares with Disjoint Subsquares using Rational Outline Squares
The electronic journal of combinatorics, Tome 32 (2025) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper we consider the problem of finding latin squares with sets of pairwise disjoint subsquares. We develop a new necessary condition on the sizes of the subsquares which incorporates and extends the known conditions. We provide a construction for the case where all but two of the subsquares are the same size, and in this case the condition is sufficient. We obtain these results using symmetric rational outline squares, and additionally provide several new results and extensions to this theory.
DOI : 10.37236/14201

Tara Kemp  1   ; James G. Lefevre  1

1 University of Queensland
@article{10_37236_14201,
     author = {Tara Kemp and James G. Lefevre},
     title = {Further {Results} on {Latin} {Squares} with {Disjoint} {Subsquares} using {Rational} {Outline} {Squares}},
     journal = {The electronic journal of combinatorics},
     year = {2025},
     volume = {32},
     number = {4},
     doi = {10.37236/14201},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/14201/}
}
TY  - JOUR
AU  - Tara Kemp
AU  - James G. Lefevre
TI  - Further Results on Latin Squares with Disjoint Subsquares using Rational Outline Squares
JO  - The electronic journal of combinatorics
PY  - 2025
VL  - 32
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/14201/
DO  - 10.37236/14201
ID  - 10_37236_14201
ER  - 
%0 Journal Article
%A Tara Kemp
%A James G. Lefevre
%T Further Results on Latin Squares with Disjoint Subsquares using Rational Outline Squares
%J The electronic journal of combinatorics
%D 2025
%V 32
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/14201/
%R 10.37236/14201
%F 10_37236_14201
Tara Kemp; James G. Lefevre. Further Results on Latin Squares with Disjoint Subsquares using Rational Outline Squares. The electronic journal of combinatorics, Tome 32 (2025) no. 4. doi: 10.37236/14201

Cité par Sources :