Sets of points with pairwise distinct slopes

Abstract This article addresses the question of how many points may be placed in an m by n array so that the slopes between pairs of points have distinct values. If d ( m , n ) denotes the maximum number of points, the value of d ( m , n ) is given or bounded for m ≤ n ≤ 11. Examples are given.

[1]  Paul Erdös,et al.  Bounds for arrays of dots with distinct slopes or lengths , 1992, Comb..

[2]  G. Ringel,et al.  Solution of the heawood map-coloring problem. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[3]  N. Sloane.  A Handbook Of Integer Sequences , 1973 .