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 language | English |
|---|---|
| Pages (from-to) | 157-163 |
| Number of pages | 7 |
| Journal | Discrete Mathematics |
| Volume | 14 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1976 |
| Externally published | Yes |