A combinatorial distinction between the Euclidean and projective planes
From MaRDI portal
Publication:793745
DOI10.1016/S0195-6698(83)80036-5zbMATH Open0539.05026DBLPjournals/ejc/SzemerediT83WikidataQ56454602 ScholiaQ56454602MaRDI QIDQ793745FDOQ793745
Authors: William T. Trotter, Endre Szemerédi
Publication date: 1983
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Recommendations
Combinatorial aspects of packing and covering (05B40) Configuration theorems in linear incidence geometry (51A20) Designs and configurations (05B99)
Cites Work
Cited In (13)
- Some combinatorial properties of finite line-systems in the Euclidean plane
- On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
- Extremal problems in discrete geometry
- A survey of Sylvester's problem and its generalizations
- The Szemerédi-Trotter theorem in the complex plane
- The number of different distances determined by a set of points in the Euclidean plane
- Vapnik-Chervonenkis density in some theories without the independence property. I
- A crossing lemma for Jordan curves
- The number of unit distances is almost linear for most norms
- Extremal problems for geometric hypergraphs
- Radial points in the plane
- Density version of a theorem of Beck and Szemerédi-Trotter in combinatorial geometry
- Graphs with large obstacle numbers
This page was built for publication: A combinatorial distinction between the Euclidean and projective planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793745)