How should one select an l-element subset of a rectangular array of lattice points (points with integral coordinates) in n-dimensional Euclidean space so as to include the largest possible number of edges (pairs of points differing in exactly one coordinate)? It is shown that the generalized Macaulay theorem due to the author and B. Lindström contains the (known) solution.
No takes yet. Share an insight, caveat, or question.
G. F. Clements (1971) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: