Abstract
The problem of efficient computation of maximum matchings in the n-dimensional cube, which is applied in coding theory, is solved. For an odd n, such a matching can be found by the method given in our Theorem 2. This method is based on the explicit construction (Theorem 1) of the maps of the vertex set that induce largest matchings in any bipartite subgraph of the n-dimensional cube for any n.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969.
P. J. Cameron and J. H. Van Lint, Graph Theory, Coding Theory, and Block Designs, Cambridge University Press, Cambridge, 1975.
D. König, “Graphen und Matrizen,” Mat. Fiz. Lapok, 38 (1931), 116–119.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tarakanov, V.E. Maximum Matchings in the n-Dimensional Cube. Mathematical Notes 69, 411–420 (2001). https://doi.org/10.1023/A:1010243727233
Issue Date:
DOI: https://doi.org/10.1023/A:1010243727233