Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (pp. 129--131). is a set of points in the plane, and a connecting line (in the paper, simply a line) is a straight line containing at least two points of . The -th band consists of the configurations in which a largest collinear subset has exactly points. Write
Lemma 1 (p. 131). For all , the largest number of lines determined by a configuration in the -th band is , and the number of lines of every configuration in the -th band is at least .
The paper adds (p. 132) that, with , the lemma holds for and . It attributes the lower bound to Kelly and Moser (its reference [7]); the upper bound is attained when the points off the large line are in general position (p. 130 and figure 2, p. 131).
Proof pointer
P. 132. The upper bound counts the lines among the points off the large line, the lines joining them to the points on it, and the large line. For the lower bound, two points off the large line share at most one line through a point of it, so at least of the joining lines are distinct; adding the large line gives .
Read depth
Claims checked: the definitions, the statement and its range were read clause by clause on the page images of the print, and the proof on p. 132 was followed. Nothing here is independently reviewed.
Dependencies
None in the corpus. External input named by the paper: the lower bound of Kelly and Moser, On the number of ordinary lines determined by points, Canad. J. Math. 10 (1958), 210--219.
Source. P. Salamon and P. Erdős, The solution to a problem of Grünbaum, Canad. Math. Bull. 31 (1988), no. 2, 129--138, DOI 10.4153/CMB-1988-020-2; the edition read is named on the source card.
Bears on
- Problem 606: the lemma confines the line counts of each band to the interval from to , the frame in which the paper describes the possible values band by band; on its own it does not say which values in that interval occur.