The existence of Room squares

DOI10.1007/BF01834113zbMath0315.05014OpenAlexW3044733345MaRDI QIDQ1220936

Ronald C. Mullin, Walter D. Wallis

Publication date: 1975

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/136522

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

A Fast Algorithm for Finding Strong Starters ⋮ Designs with mutually orthogonal resolutions ⋮ On generalized Howell designs with block size three ⋮ The existence of orthogonal resolutions of lines in AG(n,q) ⋮ Hyperplane skew resolutions and their applications ⋮ The existence of Room 5-cubes ⋮ On Nonisomorphic Room Squares ⋮ The existence of doubly resolvable \((v,3,2)\)-BIBDs ⋮ 3-complementary frames and doubly near resolvable (v,3,2)-BIBDs ⋮ Pairwise balanced designs with block sizes \(6t+1\) ⋮ Symmetry groups related to the construction of perfect one factorizations of \(K_{2n}\) ⋮ Orthogonal resolutions in odd balanced tournament designs ⋮ Room squares with holes of sides 3, 5, and 7 ⋮ The existence of Howell designs of even side ⋮ On partial parallel classes in partial Steiner triple systems ⋮ Generalized packing designs ⋮ Orthogonal one-factorizations of complete multipartite graphs ⋮ The asymptotic existence of \(\mathrm{DR}(v,k,k-1)\)-BIBDs ⋮ Orthogonally Resolvable Cycle Decompositions ⋮ A tutorial on graph models for scheduling round‐robin sports tournaments ⋮ Orthogonally resolvable matching designs ⋮ Doubly resolvable designs ⋮ On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays ⋮ Maximal partial Room squares ⋮ The existence of large set of symmetric partitioned incomplete latin squares ⋮ Transversal designs and doubly-resolvable designs ⋮ Room designs and one-factorizations ⋮ Some Howell designs of prime side. II ⋮ The existence of Howell designs of odd side ⋮ Pairwise balanced designs with odd block sizes exceeding five ⋮ The spectrum of room cubes ⋮ The existence of Howell designs of side n+1 and order 2n ⋮ Room squares with super-simple property ⋮ On existence of two classes of generalized Howell designs with block size three and index two ⋮ Doubly resolvable 4-cycle systems of \(2K_v\) ⋮ Doubly resolvable H designs ⋮ A few more Kirkman squares and doubly near resolvable BIBDs with block size 3 ⋮ Existence results for doubly near resolvable \((v,3,2)\)-BIBDs ⋮ A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares ⋮ Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs ⋮ Towards the spectrum of Room squares with subsquares ⋮ Compatibly ordered-OSTS of order \(n\) and compatibly ordered-OGDD of type \(h^n\) for \(n=6k+1\) ⋮ Howell designs of type \(H(p-1, p+1)\) ⋮ Orthogonal systems ⋮ Bounds for permutation arrays ⋮ Pairwise Orthogonal generalized room squares and equidistant permutation arrays ⋮ Generalized balanced tournament designs and related codes ⋮ Orthogonal starters in finite abelian groups ⋮ Some howell designs of prime side ⋮ Balanced tournament designs and related topics ⋮ Room square patterns ⋮ Perpendicularly separable quasigroups ⋮ The existence of \(\text{KS}_3(v;2,4)\) ⋮ The spectrum of Room cubes ⋮ The skew chromatic index of a graph ⋮ A Kirkman square of order 51 and block size 3 ⋮ An even side analogue of Room squares ⋮ On strong starters in cyclic groups ⋮ Some new resolvable GDDs with \(k = 4\) and doubly resolvable GDDs with \(k = 3\) ⋮ Howell designs with sub-designs ⋮ Scheduling CCRR tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalence of Room designs. I
• Room designs and one-factorizations
• Some new classes of strong starters
• On the maximal number of pairwise orthogonal Steiner triple systems
• Equivalence of Room designs. II
• Room squares with sub-squares
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Orthogonal Steiner systems
• Latin squares orthogonal to their transposes
• A recursive construction for Room designs
• Room quasigroups and Fermat primes
• On the existence of Room squares of order \(4n\)
• Constructions for balanced Howell rotations for bridge tournaments
• Quintuplication of Room squares
• A multiplication theorem for Room squares
• On Room squares of order \(6m+2\)
• A doubling construction for Room squares
• On balanced Room squares and complete balanced Howell rotations
• On the existence of Room squares
• Construction of perpendicular Steiner quasigroups
• Some Balanced Howell Rotations for Duplicate Bridge Sessions
• A Construction for Room's Squares and an Application in Experimental Design
• A combinatorial problem of T. G. Room
• Construction of Room Squares
• An Existence Theorem for Room Squares*
• On furnishing Room squares
• A counterexample to a direct product construction of Room squares
• On the Nonexistence of Orthogonal Steiner Systems of Order 9
• On Stanton and Mullin's Construction of Room Squares
• Analysis of Room's Square Design
• An Algebraic Construction for Room Squares
• Duplication of Room squares
• On one-factorizations of complete graphs
• A Room Design of Order 10