On the covering cuts of c d (d\(\leq 5)\) (Q1097520)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4034536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the covering cuts of c d (d\(\leq 5)\) |
scientific article; zbMATH DE number 4034536 |
Statements
On the covering cuts of c d (d\(\leq 5)\) (English)
0 references
1988
0 references
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.
0 references
cut complex
0 references
d-dimensional cube
0 references
cut number
0 references
0.8992118835449219
0 references
0.8899387121200562
0 references
0.8692924976348877
0 references
0.8449044227600098
0 references
0.8345820307731628
0 references
