Sets of Lattice Points which Contain a Maximal Number of Edges
- 1 January 1971
- journal article
- Published by JSTOR in Proceedings of the American Mathematical Society
- Vol. 27 (1) , 13-15
- https://doi.org/10.2307/2037250
Abstract
How should one select an -element subset of a rectangular array of lattice points (points with integral coordinates) in -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.Keywords
This publication has 3 references indexed in Scilit:
- A Theorem of Finite SetsPublished by Springer Nature ,2009
- A generalization of a combinatorial theorem of macaulayJournal of Combinatorial Theory, 1969
- Optimal Assignments of Numbers to VerticesJournal of the Society for Industrial and Applied Mathematics, 1964