Pages that link to "Item:Q3270190"
From MaRDI portal
The following pages link to On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order (Q3270190):
Displayed 42 items.
- Mutually orthogonal equitable Latin rectangles (Q536227) (← links)
- Coding with injections (Q690670) (← links)
- Resolvable group divisible designs with large groups (Q727201) (← links)
- Ernst G. Straus (1922-1983) (Q800339) (← links)
- Asymptotic existence theorems for frames and group divisible designs (Q878009) (← links)
- Percentages in pairwise balanced designs (Q908919) (← links)
- Linear spaces with small generated subspaces (Q1003656) (← links)
- Developments on spectral characterizations of graphs (Q1011495) (← links)
- How to guess two letters correctly (Q1194746) (← links)
- Tactical constructions (Q1220077) (← links)
- Edge partitions of complete multipartite graphs into equal length circuits (Q1220088) (← links)
- Balanced incomplete block designs and related designs (Q1239567) (← links)
- Maximal sets of Latin squares and partial transversals (Q1251665) (← links)
- Finite embedding theorems for partial pairwise balanced designs (Q1254323) (← links)
- Strongly regular graphs with smallest eigenvalue -m (Q1257906) (← links)
- \(d\)-dimensional hypercubes and the Euler and MacNeish conjectures (Q1346764) (← links)
- Eine Bemerkung zur Abschätzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren (Q1837185) (← links)
- Concerning the number of mutually orthogonal latin squares (Q1844237) (← links)
- Enumerating extensions of mutually orthogonal Latin squares (Q2004974) (← links)
- A lower bound on HMOLS with equal sized holes (Q2041120) (← links)
- Automorphism subgroups for designs with \(\lambda =1\) (Q2168076) (← links)
- Pairwise balanced designs with prescribed minimum dimension (Q2250055) (← links)
- A lower bound on permutation codes of distance \(n-1\) (Q2285776) (← links)
- New lower bounds for permutation arrays using contraction (Q2324789) (← links)
- Constructions and uses of incomplete pairwise balanced designs (Q2334435) (← links)
- Mutually orthogonal Latin squares with large holes (Q2343836) (← links)
- Clique decompositions of multipartite graphs and completion of Latin squares (Q2363362) (← links)
- Relative difference sets partitioned by cosets (Q2409828) (← links)
- On balanced incomplete block designs with specified weak chromatic number (Q2434889) (← links)
- Equivalence classes of Latin squares and nets in \(\mathbb{CP}^{2}\) (Q2450836) (← links)
- On multi-index assignment polytopes (Q2494661) (← links)
- Three mutually orthogonal Latin squares (Q2554333) (← links)
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms (Q2561219) (← links)
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures (Q2561220) (← links)
- On splittable colorings of graphs and hypergraphs (Q3150170) (← links)
- Orthogonal one-factorization graphs (Q3714116) (← links)
- Orthogonal latin square graphs (Q3855228) (← links)
- Orthogonal partitions and covering of graphs (Q3904638) (← links)
- A. translation of J. X. Lu's “an existence theory for resolvable balanced incomplete block designs” (Q4373401) (← links)
- Leaves for packings with block size four (Q5000309) (← links)
- A Three‐Factor Product Construction for Mutually Orthogonal Latin Squares (Q5256675) (← links)
- Cross‐intersecting couples of graphs (Q5434247) (← links)