A Combinatorial Distinction Between the Euclidean and Projective Planes

E. Szemerédi, W. T. Trotter

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

Let n and m be integers with n = m2 + m + 1. Then the projective plane of order m has n points and n lines with each line containing m + ≈ n1/2 points. In this paper, we consider the analogous problem for the Euclidean plane and show that there cannot be a comparably large collection of lines each of which contains approximately n1/2 points from a given set of n points. More precisely, we show that for every δ 〉 0, there exist constants c, n0 so that if n ⩾ n0, it is not possible to find n points in the Euclidean plane and a collection of at least cn1/2 lines each containing at least δn1/2 of the points. This theorem answers a question posed by P. Erdös. The proof involves a covering lemma, which may be of independent interest, and an application of the first author's regularity lemma.

Original languageEnglish
Pages (from-to)385-394
Number of pages10
JournalEuropean Journal of Combinatorics
Volume4
Issue number4
DOIs
Publication statusPublished - Jan 1 1983

Fingerprint

Euclidean plane
Projective plane
Line
Regularity Lemma
Lemma
Covering
Integer
Theorem

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

A Combinatorial Distinction Between the Euclidean and Projective Planes. / Szemerédi, E.; Trotter, W. T.

In: European Journal of Combinatorics, Vol. 4, No. 4, 01.01.1983, p. 385-394.

Research output: Contribution to journalArticle

@article{83f33096a5094d0fa5a67222bc78f6b4,
title = "A Combinatorial Distinction Between the Euclidean and Projective Planes",
abstract = "Let n and m be integers with n = m2 + m + 1. Then the projective plane of order m has n points and n lines with each line containing m + ≈ n1/2 points. In this paper, we consider the analogous problem for the Euclidean plane and show that there cannot be a comparably large collection of lines each of which contains approximately n1/2 points from a given set of n points. More precisely, we show that for every δ 〉 0, there exist constants c, n0 so that if n ⩾ n0, it is not possible to find n points in the Euclidean plane and a collection of at least cn1/2 lines each containing at least δn1/2 of the points. This theorem answers a question posed by P. Erd{\"o}s. The proof involves a covering lemma, which may be of independent interest, and an application of the first author's regularity lemma.",
author = "E. Szemer{\'e}di and Trotter, {W. T.}",
year = "1983",
month = "1",
day = "1",
doi = "10.1016/S0195-6698(83)80036-5",
language = "English",
volume = "4",
pages = "385--394",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",
number = "4",

}

TY - JOUR

T1 - A Combinatorial Distinction Between the Euclidean and Projective Planes

AU - Szemerédi, E.

AU - Trotter, W. T.

PY - 1983/1/1

Y1 - 1983/1/1

N2 - Let n and m be integers with n = m2 + m + 1. Then the projective plane of order m has n points and n lines with each line containing m + ≈ n1/2 points. In this paper, we consider the analogous problem for the Euclidean plane and show that there cannot be a comparably large collection of lines each of which contains approximately n1/2 points from a given set of n points. More precisely, we show that for every δ 〉 0, there exist constants c, n0 so that if n ⩾ n0, it is not possible to find n points in the Euclidean plane and a collection of at least cn1/2 lines each containing at least δn1/2 of the points. This theorem answers a question posed by P. Erdös. The proof involves a covering lemma, which may be of independent interest, and an application of the first author's regularity lemma.

AB - Let n and m be integers with n = m2 + m + 1. Then the projective plane of order m has n points and n lines with each line containing m + ≈ n1/2 points. In this paper, we consider the analogous problem for the Euclidean plane and show that there cannot be a comparably large collection of lines each of which contains approximately n1/2 points from a given set of n points. More precisely, we show that for every δ 〉 0, there exist constants c, n0 so that if n ⩾ n0, it is not possible to find n points in the Euclidean plane and a collection of at least cn1/2 lines each containing at least δn1/2 of the points. This theorem answers a question posed by P. Erdös. The proof involves a covering lemma, which may be of independent interest, and an application of the first author's regularity lemma.

UR - http://www.scopus.com/inward/record.url?scp=85008387823&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85008387823&partnerID=8YFLogxK

U2 - 10.1016/S0195-6698(83)80036-5

DO - 10.1016/S0195-6698(83)80036-5

M3 - Article

AN - SCOPUS:85008387823

VL - 4

SP - 385

EP - 394

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

IS - 4

ER -