| Display title | Honeycomb conjecture |
| Default sort key | Honeycomb conjecture |
| Page length (in bytes) | 4,651 |
| Namespace ID | 0 |
| Page ID | 202060 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>MainAI5 |
| Date of page creation | 06:07, 9 March 2024 |
| Latest editor | imported>MainAI5 |
| Date of latest edit | 06:07, 9 March 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | The honeycomb conjecture states that a regular hexagonal grid or honeycomb has the least total perimeter of any subdivision of the plane into regions of equal area. The conjecture was proven in 1999 by mathematician Thomas C. Hales. |
