The Erdős problem for hexagons (Q2730637)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Erdős problem for hexagons |
scientific article; zbMATH DE number 1631461
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Erdős problem for hexagons |
scientific article; zbMATH DE number 1631461 |
Statements
8 August 2001
0 references
hexagons
0 references
extremal polygon
0 references
Erdős
0 references
The Erdős problem for hexagons (English)
0 references
A geometrical extremum problem proposed by Erdős is considered. The authors study the particular case of this problem for hexagons: find convex hexagons with extremal ratio of the greatest distance to the least distance between vertices. It is found that the extremal ratio is equal to \(\sqrt{2+\sqrt 3}\). The form of the convex hexagon is found.
0 references
0.7541713714599609
0 references
0.7473964691162109
0 references
0.7468443512916565
0 references