Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:category |
geometry problem
|
| gptkbp:concerns |
distribution of points in a unit square
|
| gptkbp:field |
discrete geometry
|
| https://www.w3.org/2000/01/rdf-schema#label |
Heilbronn triangle problem
|
| gptkbp:namedAfter |
gptkb:Hans_Heilbronn
|
| gptkbp:notableAchievement |
for n=5, minimum area is 1/16
for n=7, minimum area is 1/49 |
| gptkbp:numberOfIssues |
exact value for general n is unknown
|
| gptkbp:proposedBy |
1946
|
| gptkbp:relatedTo |
gptkb:Erdős_distinct_distances_problem
gptkb:combinatorial_geometry |
| gptkbp:studiedBy |
gptkb:Hans_Heilbronn
gptkb:Paul_Erdős |
| gptkbp:type |
What is the largest possible minimum area of a triangle formed by any three of n points placed in a unit square?
|
| gptkbp:bfsParent |
gptkb:Hans_Heilbronn
|
| gptkbp:bfsLayer |
5
|