On the Number of Ordinary Lines Determined by n Points
From MaRDI portal
(Redirected from Publication:3249352)
Cited in
(54)- Research problems
- Triangles in arrangements of lines
- On Perles' configuration
- On the affine Sylvester problem
- Bichromatic and equichromatic lines in C^2 and R^2
- A Gallai-type problem
- On sets defining few ordinary lines
- A Sylvester theorem for conic sections
- The number of lines determined by \(n^2\) points
- On the number of ordinary conics
- A constructive version of the Sylvester-Gallai theorem
- Visibility and parallelotopes in projective space
- Beck's theorem for plane curves
- Grünbaum's gap conjecture
- Geometric matrices and an inequality for (0,1)-matrices
- The ordinary line problem revisited
- Some combinatorial problems in the plane
- On the combinatorial problems which I would most like to see solved
- There exist \(6n/13\) ordinary points
- A proof of a consequence of Dirac's conjecture
- On Zonotopes
- On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes
- On sets defining few ordinary planes
- Affine embeddings of Sylvester-Gallai designs
- On the minimum number of ordinary conics
- A survey of Sylvester's problem and its generalizations
- Beitrag zur kombinatorischen Inzidenzgeometrie
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- A Generalization of the Theorem of Sylvester
- Lines, circles, planes and spheres
- On the number of ordinary planes
- \(n^ 2\)-sets in a projective plane which determine exactly \(n^ 2+n\) lines
- On the number of circles determined byn points
- On a question related to Sylvester-Gallai theorem
- There are not too many magic configurations
- The Dirac-Goodman-Pollack conjecture
- Proof of a conjecture of Burr, Grünbaum, and Sloane
- On the number of circles determined by \(n\) points in the Euclidean plane
- On the number of ordinary circles determined by \(n\) points
- Geometria combinatoria e geometrie finite
- Extension of certain combinatorial estimates with geometrical background
- A generalisation of Sylvester's problem to higher dimensions
- On the geometry of real or complex supersolvable line arrangements
- Few slopes without collinearity
- On finite sets of points in \(P^ 3\)
- On the number of ordinary lines determined by sets in complex space
- Arrangements of lines with tree resolutions
- The use of research problems in high school geometry
- Progress on Dirac's conjecture
- Über die Projektionenkörper konvexer Polytope
- Triangles in arrangements of lines
- Triangles in arrangements of lines
- On ordinary points in arrangements
- On a generalization of the Gallai-Sylvester theorem
This page was built for publication: On the Number of Ordinary Lines Determined by n Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3249352)
