๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On a problem of Yuzvinsky on separating the n-cube

โœ Scribed by D.J. Kleitman

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
474 KB
Volume
60
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

A note on the edges of the n-cube
A note on the edges of the n-cube
โœ Sergiu Hart ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 671 KB

The following combinatorial problem, which arose in game theory, is solved here: To tind a selt of vertices of ;P given size (in t.k nxube) which has a maximal number sf interconnecting edges,

A note on triangulating the 5-cube
A note on triangulating the 5-cube
โœ Mark N. Broadie; Richard W. Cottle ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 888 KB
On a class of lattices associated with n
On a class of lattices associated with n-cubes
โœ Francesco Mazzocca ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 265 KB

A Lattice L(X) is defined starting from a cubical lattice L and an increasing diagonally closed subset X of L (Section 1). The lattice L(X) are proved to be--up to isomorphism--precisely those of signed simplexes of a simplical complex (Section 2); furthermore, an algebraic combinatorial characteriz