Question: let a hypercube be of dimension p find the maximum...
Let a hypercube be of dimension p. Find the maximum number of nodes (on vertices) for which no vertex is connected via edge to more than one node. Note: it is ok if some vertices do not have connections to nodes.
I really have no idea how to start this problem so please help in any way. Also, a general pattern for p would be really useful. Thanks so much in advance!!!