Orthogonally Resolvable Matching Designs |
| |
Authors: | P Danziger S Park |
| |
Institution: | Department of Mathematics, Ryerson University, Toronto, ON M5B 2K3, Canada |
| |
Abstract: | An orthogonally resolvable matching design OMD is a partition of the edges of the complete graph into matchings of size , called blocks, such that the blocks can be resolved in two different ways. Such a design can be represented as a square array whose cells are either empty or contain a matching of size , where every vertex appears exactly once in each row and column. In this paper we show that an OMD exists if and only if except when and or . |
| |
Keywords: | Orthogonal designs Orthogonal matchings Generalized Room squares |
本文献已被 ScienceDirect 等数据库收录! |
|