Latin squares with five disjoint subsquares

Abstract Given an integer partition of , is it possible to find an order latin square with pairwise disjoint subsquares of orders ? This question was posed by Fuchs and has been answered for all partitions with . In this paper, we answer the question in the case and expand on results for special cases of this, such as when the largest part is at most three times the smallest part.

Authors

Institutions

Publication Details

Journal
Journal of Combinatorial Designs
Published
2024-10-16
DOI
https://doi.org/10.1002/jcd.21960
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Latin squares with five disjoint subsquares

Tara Kemp
Journal of Combinatorial Designs
graph theory and CDMA systems
article

Latin squares with five disjoint subsquares

Tara Kemp
article en

Abstract

Abstract Given an integer partition of , is it possible to find an order latin square with pairwise disjoint subsquares of orders ? This question was posed by Fuchs and has been answered for all partitions with . In this paper, we answer the question in the case and expand on results for special cases of this, such as when the largest part is at most three times the smallest part.

Journal of Combinatorial DesignsVol. 33(2)
The University of Queensland (AU), ARC Centre of Excellence for Plant Success in Nature and Agriculture (AU)
Australian Government
Reduced inequalities
Openalex Percentile: Top 84%
graph theory and CDMA systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.