scientific article; zbMATH DE number 1305394
From MaRDI portal
Publication:4252275
Recommendations
- A lower bound for Heilbronn's triangle problem in d dimensions
- An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
- Generalizations of Heilbronn's triangle problem
- Generalizations of Heilbronn's Triangle Problem
- The On-Line Heilbronn’s Triangle Problem in d Dimensions
- The on-line Heilbronn's triangle problem in \(d\) dimensions
- Heilbronn triangle‐type problems in the unit square [0,1]2
- A lower bound on the number of triangulations of planar point sets
- Lower bounds on the number of triangles in a graph
- An improved lower bound on the minimum number of triangulations
Cited in
(18)- The on-line Heilbronn's triangle problem
- Two geometrical applications of the semi-random method
- A lower bound for Heilbronn's triangle problem in d dimensions
- scientific article; zbMATH DE number 2086227 (Why is no real title available?)
- scientific article; zbMATH DE number 1829586 (Why is no real title available?)
- scientific article; zbMATH DE number 3884879 (Why is no real title available?)
- Generalizations of Heilbronn's Triangle Problem
- Heilbronn's triangle problem
- A new lower bound based on Gromov's method of selecting heavily covered points
- The average‐case area of Heilbronn‐type triangles*
- Computing and Combinatorics
- scientific article; zbMATH DE number 2089991 (Why is no real title available?)
- scientific article; zbMATH DE number 1445287 (Why is no real title available?)
- An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
- A duality between small-face problems in arrangements of lines and Heilbronn-type problems
- New lower bounds for Heilbronn numbers
- Upper bounds for Heilbronn's triangle problem in higher dimensions
- On Gromov's method of selecting heavily covered points
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252275)
