Abstract
A collection ofk-matchings of bipartite graphK n,n with the property that every pair of independent edges lies in exactly λ of thek-matchings is called a BIMATCH(n, k λ)-design. Existences and constructions for various BIMATCH (n, k λ)-designs are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alspach, B. and Heinrich, K., Matching designs,Australian J. of Combin.,2 (1990), 39–55.
Wilson, R.M., Cyclotomy and difference families in elementary Abelian groups,J. Number Th.,4 (1972), 17–42.
Beth, Th., Jungnickel, D. and Lenz, H., Design Theory, Cambridge University Press, Cambridge.
Bosak, J., Decomposion of Graphs, Klauver Academic Publishers, London, 1990.
Zhang, Y., Existence of blanced incomplete block designs withk=7 and λ=1, In: Combinatorial Designs and Applications, Wallis, W. D.,et al. Eds., Marcel Dekker Inc., New York, 1990.
Berge, C., Graph and Hypergraphs, North-Holland, Amsterdam, 1973.
Zhu L. and Wu S., Existence of BIBD’s with block size seven,Utilitas Math.,38, (1990), 3–13.
Jungnickel, D. and Vanstone, S.A., Hyperfactorization of graphs and 5-designs,J. Univ. Kuwait (Sci),14 (1987), 213–223.
Zhou L., Existence of three-fold BIBD with block-size seven,Applied Math.,7(1992).
Zhou, L., Existence of (v,8,1)-BIBD, In: Combinatorial Designs and Applications, Wallis W.D.,et al. Eds., Marcel Dekker, New York, 1990.
Author information
Authors and Affiliations
Additional information
Supported partly by the National Science and Engineering Research Council of Canada and the National Natural Science Foundation of China.
Rights and permissions
About this article
Cite this article
Cuiqin, L., Heinrich, K. Bimatching designs. Appl. Math. 9, 77–84 (1994). https://doi.org/10.1007/BF02662028
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02662028