On the covering cuts of c d (d\(\leq 5)\)

DOI10.1016/0012-365X(88)90112-4zbMath0635.52005OpenAlexW1969482613MaRDI QIDQ1097520

M. Reza Emamy-K.

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90112-4

zbMATH Keywords

cut numbercut complexd-dimensional cube

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx)

Related Items

A geometric connection to threshold logic via cubical lattices ⋮ On the cut number problem for the 4, and 5-cubes ⋮ On the coverings of the \(d\)-cube for \(d\leq 6\) ⋮ The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Untersuchungen über die Dualität zwischen Schnitten und Submannigfaltigkeiten konvexer Polytope und allgemeiner kombinatorischer Mannigfaltigkeiten
• On the cuts and cut number of the 4-cube
• Intersecting all edges of convex polytopes by planes
• Schnitt- und Überdeckungszahlen kombinatorischer Sphären
• Cu t numbers of convex polytopes
• Hyperplane cuts of an n-cube
• Intersecting all edges of centrally symmetric polyhedra by planes