On a leverage problem in the hypercube

DOI10.1002/NET.3230220502MaRDI QIDQ4014610zbMATH OpenOpenAlexFDO

Authors Peter Hamburger, W. Douglas Weakley, Raymond E. Pippert

Publication date 13 October 1992

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230220502

zbMATH Keywords

distanceshypercubeleverage problemperfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Existence of a maximum balanced matching in the hypercube
• The minimum forcing number of perfect matchings in the hypercube
• Matchings and paths in the cube
• Maximum matchings in the \(n\)-dimensional cube

Cited in

(2)

• scientific article; zbMATH DE number 867676 (Why is no real title available?)
• Clique matchings in the \(k\)-ary \(n\)-dimensional cube

This page was built for publication: On a leverage problem in the hypercube

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