On the cuts and cut number of the 4-cube
From MaRDI portal
Publication:1073345
DOI10.1016/0097-3165(86)90081-6zbMath0588.52007OpenAlexW2146415227MaRDI QIDQ1073345
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(86)90081-6
Inequalities and extremum problems involving convexity in convex geometry (52A40) Other problems of combinatorial convexity (52A37) Polytopes and polyhedra (52Bxx)
Related Items
On the covering cuts of c d (d\(\leq 5)\) ⋮ A geometric connection to threshold logic via cubical lattices ⋮ On the cut number problem for the 4, and 5-cubes ⋮ On the cut-complexes of the 5-cube ⋮ On the coverings of the \(d\)-cube for \(d\leq 6\) ⋮ Geometry of cut-complexes and threshold logic ⋮ The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic
Cites Work
- Unnamed Item
- Untersuchungen über die Dualität zwischen Schnitten und Submannigfaltigkeiten konvexer Polytope und allgemeiner kombinatorischer Mannigfaltigkeiten
- 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
- Matchings in polytopal graphs