A combinatorial distinction between the Euclidean and projective planes
From MaRDI portal
Publication:793745
DOI10.1016/S0195-6698(83)80036-5zbMath0539.05026WikidataQ56454602 ScholiaQ56454602MaRDI QIDQ793745
William T. jun. Trotter, Endre Szemerédi
Publication date: 1983
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Combinatorial aspects of packing and covering (05B40) Configuration theorems in linear incidence geometry (51A20) Designs and configurations (05B99)
Related Items
The Szemerédi-Trotter theorem in the complex plane, A survey of Sylvester's problem and its generalizations, A crossing lemma for Jordan curves, The number of unit distances is almost linear for most norms, On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves, The number of different distances determined by a set of points in the Euclidean plane, Radial points in the plane, Graphs with Large Obstacle Numbers, Vapnik-Chervonenkis density in some theories without the independence property, I, Extremal problems in discrete geometry
Cites Work
