On the covering cuts of c d (d\(\leq 5)\) (Q1097520): Difference between revisions

By c d is denoted the d-dimensional cube. The cut number K(c d) of c d is the minimal number of cuts needed to cover all edges of c d. A new proof is given of Grünbaum's Theorem that \(K(c\quad 4)=4.\) Moreover, it is shown that the maximal number of edges of c 4 covered by 3 cuts is 30 and that, up to isomorphism, there is only one cut for c 5 that contains edges from all subfacets of the 5-cube.