摘要
A collection of k-matchings of bipartite graph Kn,n with the property thatevery pair of independent edges lies in exactly λ of the k-matchings is called aBIMATCH(n,k,λ)-design. Existences and constructions for various BIMATCH (n,k,λ)designs are given.
ＢＩＭＡＴＣＨＩＮＧＤＥＳＩＧＮＳ￥ＬＩＮＣＵＩＱＩＮ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ＴｓｉｎｇｈｕａＵｎｉｖｅｒｓｉｔｙ，Ｂｅｉｊｉｎｇ，１０００８４）ＫＡＴＨＥＲＩＮＥＨＥＩＮＲＩＣＨ（ＤｅｐａｒｔｍｅｎｔｏｆＭａ...
