No l Grid-Points in Spaces of Small Dimension
From MaRDI portal
Publication:3511434
DOI10.1007/978-3-540-68880-8_25zbMath1143.68504OpenAlexW1487682591MaRDI QIDQ3511434
Publication date: 10 July 2008
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68880-8_25
Graph theory (including graph drawing) in computer science (68R10) Other designs, configurations (05B30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Three-dimensional graph drawing
- No-three-in-line-in-3D
- Extremal uncrowded hypergraphs
- Bounds for arrays of dots with distinct slopes or lengths
- Progress in the no-three-in-line-problem
- Progress in the no-three-in-line problem. II
- On counting point-hyperplane incidences
- Turan's theorem for \(k\)-graphs
- Research Problems in Discrete Geometry
- Maximal Independent Subsets in Steiner Systems and in Planar Sets
- The Algorithmic Aspects of Uncrowded Hypergraphs
- On uncrowded hypergraphs
- On a Problem of Heilbronn
- Covering lattice points by subspaces
This page was built for publication: No l Grid-Points in Spaces of Small Dimension
