The No-Three-In-Line Problem
From MaRDI portal
Cited in
(17)- Progress in the no-three-in-line-problem
- Some advances in the no-three-in-line problem
- Arcs in \(\mathbb Z^2_{2p}\)
- On no-three-in-line problem on \(m\)-dimensional torus
- On counting point-hyperplane incidences
- Geometric dominating sets -- a minimum version of the no-three-in-line problem
- Applying iterated mapping to the no-three-in-a-line problem
- Geometria combinatoria e geometrie finite
- Finding points in general position
- A note on the no-three-in-line problem on a torus
- Convex polygons in Cartesian products
- Permutations minimizing the number of collinear triples
- Lower general position sets in graphs
- The k-general d-position problem for graphs
- Constraint satisfaction programming for the no-three-in-line problem
- On subsets of lattice cubes avoiding affine and spherical degeneracies
- Update on the no-three-in-line problem
This page was built for publication: The No-Three-In-Line Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5556468)