Hypercube 1-factorizations from extended Hamming codes

DOI10.1016/j.endm.2009.07.106zbMath1273.05172OpenAlexW2055933443WikidataQ114183693 ScholiaQ114183693MaRDI QIDQ2851530

Petr Gregor

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.106

Mathematics Subject Classification ID

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

Cites Work

• Rainbows in the hypercube
• Bounding the size of square-free subgraphs of the hypercube
• Equitable factorizations of Hamming shells
• Polychromatic Colorings of Subcubes of the Hypercube
• On the maximum number of edges in a c₄‐free subgraph of q_n
• Turán’s Theorem in the Hypercube
• Unnamed Item