A subspace covering problem in the n-cube

DOI10.1016/J.DAM.2015.09.008zbMATH Open1358.05225OpenAlexW1778674635MaRDI QIDQ516772FDOQ516772

Authors Harout Aydinian

Publication date 15 March 2017

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2015.09.008

zbMATH Keywords

coveringgraph decompositionpackingdimension constraint

Mathematics Subject Classification ID

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

Recommendations

• Covering the cube by affine hyperplanes
• Essential positive covers of the cube
• Exact hyperplane covers for subsets of the hypercube
• Covering of subspaces by subspaces
• Minimal covers of \(Q^+(2n+1,q)\) by \((n-1)\)-dimensional subspaces

Cites work

• scientific article; zbMATH DE number 3503285 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3235247 (Why is no real title available?)
• Covering the cube by affine hyperplanes
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Decomposition of complete multigraphs into stars
• Extremal problems under dimension constraints.
• Maximum number of constant weight vertices of the unit \(n\)-cube contained in a \(k\)-dimensional subspace
• Minimal coverings of pairs by triples
• On claw-decomposition of complete graphs and complete bigraphs
• On the covering of pairs by quadruples. I
• On the covering of pairs by quadruples. II
• On the decompositions of complete graphs into cycles and stars on the same number of edges
• Optimal packings of \(K_4\)'s into a \(K_n\)
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Packing and covering of the complete graph with a graph G of four vertices or less
• The CRC handbook of combinatorial designs
• The Existence and Construction of Balanced Incomplete Block Designs

Cited in

(5)

• THE PROBLEM OF CUTTING SUBSPACES
• Subspace coverings with multiplicities
• Covering of subspaces by subspaces
• Maximum number of constant weight vertices of the unit \(n\)-cube contained in a \(k\)-dimensional subspace
• Cyclically covering subspaces in \(\mathbb{F}_2^n\)

This page was built for publication: A subspace covering problem in the \(n\)-cube

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