A subspace covering problem in the \(n\)-cube

DOI10.1016/J.DAM.2015.09.008zbMath1358.05225OpenAlexW1778674635MaRDI QIDQ516772

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

coveringpackinggraph decompositiondimension constraint

Mathematics Subject Classification ID

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

Cites Work

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

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