Existence of a maximum balanced matching in the hypercube

DOI10.1080/15598608.2013.781454MaRDI QIDQ2320869zbMATH OpenOpenAlexFDO

Authors Krisztián Tichler, Gyula O. H. Katona

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

binary-reflected gray codehypercube

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) 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)

Recommendations

• Maximum matchings in the \(n\)-dimensional cube
• On special perfect matchings in a Boolean cube
• scientific article; zbMATH DE number 5901714
• Perfect matchings in balanced hypergraphs
• On matchings in hypergraphs

Cites work

• A Survey of Combinatorial Gray Codes
• Balanced Gray codes
• Counting sequences
• Search when the lie depends on the target

Cited in

(5)

• On special perfect matchings in a Boolean cube
• On a leverage problem in the hypercube
• Partitions and balanced matchings of an n-dimensional cube
• Maximum matchings in the \(n\)-dimensional cube
• On edge numberings of the n-cube graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2320869)