On a Problem of Heilbronn

DOI10.1112/JLMS/S1-26.3.198zbMath0043.16303OpenAlexW1966946221WikidataQ55898609 ScholiaQ55898609MaRDI QIDQ5805447

Klaus F. Roth

Publication date: 1951

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-26.3.198

zbMATH Keywords

metric geometry, convex geometry

Related Items (38)

Additive combinatorics and graph theory ⋮ The average‐case area of Heilbronn‐type triangles* ⋮ On simultaneous planar graph embeddings ⋮ Large triangles in the \(d\)-dimensional unit cube ⋮ Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing ⋮ \(\alpha\)-concave hull, a generalization of convex hull ⋮ Geometria combinatoria e geometrie finite ⋮ The extensible no-three-in-line problem ⋮ Heilbronn triangle‐type problems in the unit square [0,1²] ⋮ Heilbronn's problem of eight points in the square ⋮ Distributions of points in the unit square and large \(k\)-gons ⋮ No l Grid-Points in Spaces of Small Dimension ⋮ On the global minimum of the classical potential energy for clusters bound by many-body forces ⋮ Arcs in \(\mathbb Z^2_{2p}\) ⋮ Finding Points in General Position ⋮ On 2-site Voronoi diagrams under geometric distance functions ⋮ Covering lattice points by subspaces and counting point-hyperplane incidences ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On a Heilbronn-type problem ⋮ Grid drawings of graphs with constant edge-vertex resolution ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ A note on the no-three-in-line problem on a torus ⋮ On the number of order types in integer grids of small size ⋮ The Parameterized Complexity of Finding Point Sets with Hereditary Properties ⋮ On no-three-in-line problem on \(m\)-dimensional torus ⋮ Progress in the no-three-in-line-problem ⋮ Distributions of points in \(d\) dimensions and large \(k\) -point simplices ⋮ Some advances in the no-three-in-line problem ⋮ Grid drawings of \(k\)-colourable graphs ⋮ Developments in Heilbronn's triangle problem ⋮ Upper bounds for Heilbronn's triangle problem in higher dimensions ⋮ Point sets in the unit square and large areas of convex hulls of subsets of points ⋮ Convex polygons in Cartesian products ⋮ Update on the no-three-in-line problem ⋮ The on-line Heilbronn's triangle problem ⋮ Generalizations of Heilbronn's triangle problem ⋮ Approximating uniform triangular meshes in polygons. ⋮ Partitions of planar sets into small triangles

This page was built for publication: On a Problem of Heilbronn