Orthogonally resolvable matching designs

DOI10.1016/J.DISC.2017.11.003zbMATH Open1378.05017arXiv1707.06317OpenAlexW2963422918MaRDI QIDQ1690232FDOQ1690232

Authors: Peng Zhang 

Publication date: 19 January 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

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$.

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

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 Keywords

orthogonal designsgeneralized room squaresorthogonal matchings

Mathematics Subject Classification ID

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

Cites Work

• The CRC handbook of combinatorial designs
• On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays
• The existence of Room squares
• The existence of Kirkman squares -- doubly resolvable \((v,3,1)\)-BIBDs
• A few more Kirkman squares and doubly near resolvable BIBDs with block size 3
• Orthogonally Resolvable Cycle Decompositions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

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)