Sources
The Honeycomb Conjecture
Citation Formats
General Reference
APA Style
BibTeX
The Honeycomb Conjecture, Thomas C. Hales's 2001 peer reviewed paper in Discrete and Computational Geometry, first circulated as a 1999 preprint, is the peer reviewed proof of the conjecture that regular hexagons provide the most efficient way to divide a surface into regions of equal area with the least total perimeter. Its strength is that it is the peer reviewed proof itself, with a documented history back to antiquity. Its limit, stated as a scope note, is that it should be used for this paper's own proof and scope; the earlier 1943 proof of the conjecture's convex case belongs to Laszlo Fejes Toth, not to this paper.
Facts
Citation
AuthorThomas C. Hales
PublisherDiscrete and Computational Geometry
Publication Year2001
URLhttps://arxiv.org/abs/math/9906042
Source Typepeer-reviewed article
Assessment
Reliability Tier1
Reliability tier 1: the peer reviewed proof itself, with a documented history back to antiquity. NotesThe 1999 result completed the general classification; Fejes Toth had already proved the convex case in 1943.
Claims Backed By This Source (9 claims)
This source backs 9 claims across the atlas. As facts: 8 well-attested. Plus 1 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Sources, 8 claims: 8 well-attested.
- Sacred Geometry, 1 claims: 1 general references.
Reader Challenges (0 open reader challenges)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.
View At A Past Year
The atlas records no dated fact of its own for this entry, so there is no other year to choose.