Iterated point-line configurations grow doubly-exponentially
DOI10.1007/S00454-009-9208-9zbMATH Open1194.51002arXiv0807.1549OpenAlexW2053804693MaRDI QIDQ2380786FDOQ2380786
Authors: Joshua Cooper, Mark Walters
Publication date: 12 April 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.1549
Recommendations
pigeonhole principledegree of a pointcrossing number of a graph\(n\times\,n\) griditerated configurationreal plane affine geometrySzmerédi-Trotter theorem
Erd?s problems and related topics of discrete geometry (52C10) Configuration theorems in linear incidence geometry (51A20)
Cites Work
- Graphs drawn with few crossings per edge
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Title not available (Why is that?)
- Extremal problems in discrete geometry
- A point set everywhere dense in the plane
- A dense planar point set from iterated line intersections.
- On iterative processes generating dense point sets
- On the density of iterated line segment intersections
- On point sets containing their triangle centers
- A result about the density of iterated line intersections in the plane
Cited In (4)
This page was built for publication: Iterated point-line configurations grow doubly-exponentially
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380786)