Existence of a maximum balanced matching in the hypercube

DOI10.1080/15598608.2013.781454zbMath1418.05109OpenAlexW2098097545MaRDI QIDQ2320869

Krisztián Tichler

Publication date: 27 August 2019

Published in: Journal of Statistical Theory and Practice (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/7987/1/Existence%20of%20a%20maximum%20balanced%20matching%20in%20the%20hypercube.pdf

zbMATH Keywords

hypercubebinary-reflected gray code

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Theory of error-correcting codes and error-detecting codes (94B99) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Partitions and balanced matchings of an \(n\)-dimensional cube

Cites Work

• Balanced Gray codes
• Counting sequences
• A Survey of Combinatorial Gray Codes
• Search When the Lie Depends on the Target

This page was built for publication: Existence of a maximum balanced matching in the hypercube