Honeycomb conjecture

From Wikipedia, the free encyclopedia
Jump to: navigation, search
A regular hexagonal grid

The honeycomb conjecture states that a regular hexagonal grid or honeycomb is the best way to divide a surface into regions of equal area with the least total perimeter. The first record of the conjecture dates back to 36BC, from Marcus Terentius Varro, but is often attributed to Pappus of Alexandria (c. 290 – c. 350). The conjecture was proven in 1999 by mathematician Thomas C. Hales, who mentions in his work that there is reason to believe that the conjecture may have been present in the minds of mathematicians before Varro.[1][2]

See also[edit]


  1. ^ Weisstein, Eric W. "Honeycomb Conjecture". MathWorld. Retrieved 27 Dec 2010. 
  2. ^ Hales, Thomas C. (8 Jun 1999). "The Honeycomb Conjecture". Discrete and Computational Geometry 25: 1–22 (2001). arXiv:math/9906042. doi:10.1007/s004540010071.