Existence of a Maximum Balanced Matching in the Hypercube
We prove, that for n ≠ 2 the maximum possible [2n/2n] edges can be chosen simultaneously from each parallel class of the n-cube in such a way that no two edges have a common vertex.
KeywordsConstruction Hypercube Matching
Unable to display preview. Download preview PDF.
- Gray, F. 1953. Pulse code communication. U.S Patent No. 2632058, March.Google Scholar
© Grace Scientific Publishing 2013