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

A Note on the Problem of Classifying Vertices of the n Cube into m Categories

โœ Scribed by Frola, F. R.

Book ID
117903619
Publisher
Institute of Electrical and Electronics Engineers
Year
1965
Tongue
English
Weight
410 KB
Volume
EC-14
Category
Article
ISSN
0367-7508

No coin nor oath required. For personal study only.

๐Ÿ“œ 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 ๐Ÿ‘ 1 views

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,

On a problem of Yuzvinsky on separating
On a problem of Yuzvinsky on separating the n-cube
โœ D.J. Kleitman ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 474 KB ๐Ÿ‘ 1 views

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.