On the covering cuts of c d (d\(\leq 5)\)
type: Item
instance of: scholarly article
title: On the covering cuts of c d (d\(\leq 5)\)
zbMATH Open document ID: 0635.52005
DOI: 10.1016/0012-365X(88)90112-4
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 52Bxx
zbMATH DE Number: 4034536
zbMATH Keywords: cut complex
zbMATH Keywords: d-dimensional cube
zbMATH Keywords: cut number
author: M. Reza Emamy-K.
MaRDI profile type: Publication
cites work: Cu t numbers of convex polytopes
cites work: On the cuts and cut number of the 4-cube
cites work: Q5547252
cites work: Q4085741
cites work: Intersecting all edges of centrally symmetric polyhedra by planes
cites work: Intersecting all edges of convex polytopes by planes
cites work: Hyperplane cuts of an n-cube
cites work: Untersuchungen über die Dualität zwischen Schnitten und Submannigfaltigkeiten konvexer Polytope und allgemeiner kombinatorischer Mannigfaltigkeiten
cites work: Schnitt- und Überdeckungszahlen kombinatorischer Sphären
full work available at URL: 0012-365x(88)90112-4
OpenAlex ID: W1969482613
description: scientific article; zbMATH DE number 4034536