摘要
一个ＭＡＴＣＨ（ｎ，ｋ，λ）－设计就是完全图Ｋ＿ｎ的一个ｋ－匹配集合，使得Ｋ＿ｎ的每一对独立边恰好出现在λ个ｋ－匹配中。本文构造了一个ＭＡＴＣＨ（１４，３，１）－设计，解决了文献［１］中一个尚未解决的问题，同时还得到一个ＭＡＴＣＨ（４２，３，１）－设计。
A MATCH (n, k, λ)-design is a collection of k-matchings of the complete graphK_n with the property that every pair of independent edges lies in exactly λ members ofthe collection. In this paper, we shall construct a MATCH (14,3,1)-design, which is anopen problem in [1].
