On a problem of Yuzvinsky on separating the n-cube (Q1102986)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1102986 |
scientific article; zbMATH DE number 4051686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a problem of Yuzvinsky on separating the n-cube |
scientific article; zbMATH DE number 4051686 |
Statements
On a problem of Yuzvinsky on separating the n-cube (English)
0 references
1986
0 references
The following problem of Yuzvinsky is solved here: how many vertices of the n-cube must be removed from it in order that no connected component of the rest contains an antipodal pair of vertices? Some further results and problems are described as well.
0 references
vertex removal
0 references
n-cube
0 references
antipodal pair of vertices
0 references
0.7615180611610413
0 references
0.75824373960495
0 references
0.7507169842720032
0 references
0.7460203170776367
0 references
0.7398123145103455
0 references
