Autor:	V. E. Tarakanov
Rok vydání:	2001
Předmět:	Vertex (graph theory) Discrete mathematics Combinatorics General Mathematics 3-dimensional matching Bipartite graph Folded cube graph Complete bipartite graph Blossom algorithm Tutte theorem Klee–Minty cube Mathematics
Zdroj:	Mathematical Notes. 69:411-420
ISSN:	0001-4346
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::26b7b58e5afedf7b6b0e0f4548280be6 https://doi.org/10.1023/a:1010243727233 Zobrazit plný text záznamu Full text from SpringerLink