| A MATCH (n, k, λ)-design is a collection of k-matchings of the complete graph Kn 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]. |
