Orthogonally resolvable matching designs

DOI10.1016/J.DISC.2017.11.003MaRDI QIDQ1690232zbMATH OpenOpenAlexFDO

Authors Peng Zhang

Publication date 19 January 2018

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.06317

zbMATH Keywords

orthogonal designsgeneralized room squaresorthogonal matchings

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Abstract: An Orthogonally resolvable Matching Design OMD$(n,k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, 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 $k$, where every vertex appears exactly once in each row and column. In this paper we show that an OMD$(n.k)$ exists if and only if $nequiv0pmod2k$ except when $k=1$ and $n=4$ or $6$.

Recommendations

• scientific article; zbMATH DE number 1501717
• The existence of bimatching designs
• scientific article; zbMATH DE number 800260
• Orthogonally resolvable cycle decompositions
• scientific article; zbMATH DE number 68912

Cites work

• scientific article; zbMATH DE number 4037875 (Why is no real title available?)
• scientific article; zbMATH DE number 124517 (Why is no real title available?)
• scientific article; zbMATH DE number 979131 (Why is no real title available?)
• A few more Kirkman squares and doubly near resolvable BIBDs with block size 3
• On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays
• Orthogonally resolvable cycle decompositions
• The CRC handbook of combinatorial designs
• The existence of Kirkman squares -- doubly resolvable (v,3,1)-BIBDs
• The existence of Room squares

Cited in

(1)

• scientific article; zbMATH DE number 68912 (Why is no real title available?)

This page was built for publication: Orthogonally resolvable matching designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690232)