Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T01:45:10.902Z Has data issue: false hasContentIssue false

On a Problem of Groübaum

Published online by Cambridge University Press:  20 November 2018

P. Erdös*
Affiliation:
University of Waterloo, Waterloo, OntarioUniversity of Alberta, Edmonton, Alberta
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

P n will denote a set of n points in the plane. A well known theorem of Gallai- Sylvester (see e.g. [4]) states that if the points of P n do not all lie on a line then they always determine an ordinary line, i.e. a line which goes through precisely two of the points of P n .

Using this theorem I proved that if the points do not all lie on a line, they determine at least n lines. I conjectured that if n>n0 and no n—1 points of Pn are on a line, they determine at least 2n-4 lines. This conjecture was proved by Kelly and Moser [3], who, in fact, proved the following more general result: Let P n be such that at most n—k of its points are collinear.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1972