可解析匹配设计
Orthogonally Resolvable Matching Designs
摘要:
一个可分解的匹配设计OMD $(n, k)$是将完全图$K_n$的边划分成大小为$k$的匹配,称为块,使得块可以以两种不同的方式分解。这样的设计可以表示为一个正方形阵列,其单元或者是空的,或者包含大小为$k$的匹配,其中每个顶点在每行和每列中恰好出现一次。本文证明了OMD $(n.k)$存在的充要条件是$n \equiv 0 \pmod{2k}$,除了当$k=1$和$n = 4$或$6$ .
英文摘要:
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 $n \equiv 0 \pmod{2k}$ except when $k=1$ and $n = 4$ or $6$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。