Skip to main content Accessibility help
×
Hostname: page-component-76c49bb84f-bg8zk Total loading time: 0 Render date: 2025-07-10T21:21:32.495Z Has data issue: false hasContentIssue false

Extremal Problems Related to the Sylvester—Gallai Theorem

Published online by Cambridge University Press:  27 June 2025

Jacob E. Goodman
Affiliation:
City College, City University of New York
Janos Pach
Affiliation:
City College, City University of New York and New York University
Emo Welzl
Affiliation:
Eidgenössische Technische Hochschule Zürich
Get access

Summary

We discuss certain extremal problems in combinatorial geometry, including Sylvester's problem and its generalizations.

1. Introduction

Many interesting problems in combinatorial geometry have remained unsolved or only partially solved for a long time. From time to time breakthroughs are made. In this survey, we shall discuss the known results about some metric and nonmetric problems. In particular, we shall discuss the Sylvester-Gallai problem and the Dirac-Motzkin conjecture on the existence and number of ordinary lines, the Dirac conjecture on the number of connecting lines, and the problem of distinct and repeated distances. The main focus will be on versions of these problems in the Euclidean and real projective plane. The method of allowable sequences will be described as a tool to give purely combinatorial solutions to extremal problems in combinatorial geometry.

2. Sylvester's Problem

Sylvester [1893] posed a question in the Educational Times that was to remain unsolved for 40 years until it was raised again by Erdos [1943]. Then it was soon solved by Gallai [1944], who gave an affine proof. More followed: Steinberg's proof in the projective plane and others by Buck, Grünwald and Steenrod, all collected in [Steinberg et al. 1944]; Kelly's Euclidean proof [1948], and others, including [Motzkin 1951; Lang 1955; Williams 1968].

We give the following definitions before we state the problem and its solutions. Let P be a finite set of 3 or more noncollinear points in the plane. Let F be a finite collection of simple closed curves in the real projective plane which do not separate the plane, every two of which have exactly one point in common, where they cross. F is known as a pseudoline arrangement

Information

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Book purchase

Temporarily unavailable

Accessibility standard: Unknown

Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×