A note on the edges of the n-cube

Sergiu Hart*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

112 Scopus citations

Abstract

The following combinatorial problem, which arose in game theory, is solved here: To find a set of vertices of a given size (in the n-cube) which has a maximal number of interconnecting edges.

Original languageEnglish
Pages (from-to)157-163
Number of pages7
JournalDiscrete Mathematics
Volume14
Issue number2
DOIs
StatePublished - 1976
Externally publishedYes

Fingerprint

Dive into the research topics of 'A note on the edges of the n-cube'. Together they form a unique fingerprint.

Cite this