On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
From MaRDI portal
Publication:3270190
DOI10.4153/CJM-1960-017-2zbMath0093.32001OpenAlexW1976770751WikidataQ101084134 ScholiaQ101084134MaRDI QIDQ3270190
Ernst Gabor Straus, Paul Erdős, Sarvadaman Chowla
Publication date: 1960
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1960-017-2
Related Items (42)
Clique decompositions of multipartite graphs and completion of Latin squares ⋮ Orthogonal one-factorization graphs ⋮ \(d\)-dimensional hypercubes and the Euler and MacNeish conjectures ⋮ Automorphism subgroups for designs with \(\lambda =1\) ⋮ Leaves for packings with block size four ⋮ Asymptotic existence theorems for frames and group divisible designs ⋮ Relative difference sets partitioned by cosets ⋮ Percentages in pairwise balanced designs ⋮ On balanced incomplete block designs with specified weak chromatic number ⋮ Equivalence classes of Latin squares and nets in \(\mathbb{CP}^{2}\) ⋮ Orthogonal partitions and covering of graphs ⋮ A. translation of J. X. Lu's “an existence theory for resolvable balanced incomplete block designs” ⋮ How to guess two letters correctly ⋮ Pairwise balanced designs with prescribed minimum dimension ⋮ Coding with injections ⋮ Mutually orthogonal equitable Latin rectangles ⋮ Enumerating extensions of mutually orthogonal Latin squares ⋮ Tactical constructions ⋮ Edge partitions of complete multipartite graphs into equal length circuits ⋮ Orthogonal latin square graphs ⋮ On multi-index assignment polytopes ⋮ Cross‐intersecting couples of graphs ⋮ Balanced incomplete block designs and related designs ⋮ Resolvable group divisible designs with large groups ⋮ A lower bound on permutation codes of distance \(n-1\) ⋮ Maximal sets of Latin squares and partial transversals ⋮ Linear spaces with small generated subspaces ⋮ A lower bound on HMOLS with equal sized holes ⋮ Finite embedding theorems for partial pairwise balanced designs ⋮ Strongly regular graphs with smallest eigenvalue -m ⋮ Developments on spectral characterizations of graphs ⋮ Three mutually orthogonal Latin squares ⋮ An existence theory for pairwise balanced designs. I: Composition theorems and morphisms ⋮ An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures ⋮ New lower bounds for permutation arrays using contraction ⋮ Eine Bemerkung zur Abschätzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren ⋮ Concerning the number of mutually orthogonal latin squares ⋮ Constructions and uses of incomplete pairwise balanced designs ⋮ A Three‐Factor Product Construction for Mutually Orthogonal Latin Squares ⋮ Ernst G. Straus (1922-1983) ⋮ Mutually orthogonal Latin squares with large holes ⋮ On splittable colorings of graphs and hypergraphs
This page was built for publication: On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
