On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
From MaRDI portal
Publication:789732
DOI10.1007/BF02579184zbMath0533.52004MaRDI QIDQ789732
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Related Items (59)
On some metric and combinatorial geometric problems ⋮ Two results about points, lines and planes ⋮ A note on the minimum number of red lines needed to pierce the intersections of blue lines ⋮ The Szemerédi-Trotter theorem in the complex plane ⋮ Two theorems on point-flat incidences ⋮ On the number of directions determined by a three-dimensional points set ⋮ Two combinatorial problems in the plane ⋮ Bisector energy and few distinct distances ⋮ Areas of triangles and Beck's theorem in planes over finite fields ⋮ A survey of Sylvester's problem and its generalizations ⋮ Repeated distances in space ⋮ Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs ⋮ On sets defining few ordinary lines ⋮ A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane ⋮ Lines, line-point incidences and crossing families in dense sets ⋮ Crossing by lines all edges of a line arrangement ⋮ Bichromatic Lines in the Plane ⋮ Progress on Dirac's conjecture ⋮ A pseudoline counterexample to the strong Dirac conjecture ⋮ Elementary methods for incidence problems in finite fields ⋮ On distinct perpendicular bisectors and pinned distances in finite fields ⋮ Piercing the Chessboard ⋮ AN INCIDENCE RESULT FOR WELL-SPACED ATOMS IN ALL DIMENSIONS ⋮ Cells in the box and a hyperplane ⋮ On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space ⋮ Kaufman and Falconer estimates for radial projections and a continuum version of Beck's theorem ⋮ Distinct distances between points and lines ⋮ Extending Erdős-Beck's theorem to higher dimensions ⋮ Bisectors and pinned distances ⋮ Combinatorial complexity bounds for arrangements of curves and spheres ⋮ A bichromatic incidence bound and an application ⋮ Research problems ⋮ Beck's theorem for plane curves ⋮ Hirzebruch-type inequalities viewed as tools in combinatorics ⋮ The complexity of point configurations ⋮ Growth and expansion in algebraic groups over finite fields ⋮ Repeated angles in the plane and related problems ⋮ Counting facets and incidences ⋮ The maximum number of second smallest distances in finite planar sets ⋮ Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. ⋮ A note on the weak Dirac conjecture ⋮ Extension of certain combinatorial estimates with geometrical background ⋮ Radial points in the plane ⋮ On the number of monochromatic lines in \(\mathbb{R}^d\) ⋮ AN EXPLICIT INCIDENCE THEOREM IN ⋮ The Dirac-Goodman-Pollack conjecture ⋮ On the Number of Ordinary Conics ⋮ Incidence Bounds for Block Designs ⋮ Classification theorem for strong triangle blocking arrangements ⋮ On linear combinatorics. I: Concurrency---an algebraic approach ⋮ How (Not) to Cut Your Cheese ⋮ Extremal problems on triangle areas in two and three dimensions ⋮ A point-conic incidence bound and applications over \(\mathbb{F}_p\) ⋮ Cardinalities of \(k\)-distance sets in Minkowski spaces ⋮ On distinct distances among points in general position and other related problems ⋮ Extremal problems in discrete geometry ⋮ On growth in an abstract plane ⋮ On the number of circles determined by \(n\) points in the Euclidean plane ⋮ On the combinatorics of projective mappings
Cites Work
- Unnamed Item
- Unnamed Item
- Extremal problems in discrete geometry
- Unit distances
- On the combinatorial problems which I would most like to see solved
- On some problems of elementary and combinatorial geometry
- On the Number of Ordinary Lines Determined by n Points
- COLLINEARITY PROPERTIES OF SETS OF POINTS
- The Lines and Planes Connecting the Points of a Finite Set
This page was built for publication: On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
