Hales, T. C. The honeycomb conjecture. (English) Zbl 1007.52008 Discrete Comput. Geom. 25, No. 1, 1-22 (2001). Summary: This article gives a proof of the classical honeycomb conjecture: any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal honeycomb tiling. Cited in 53 Documents MSC: 52C15 Packing and covering in \(2\) dimensions (aspects of discrete geometry) 52C20 Tilings in \(2\) dimensions (aspects of discrete geometry) Keywords:honeycomb conjecture; partition of the plane; regular hexagonal honeycomb tiling PDFBibTeX XMLCite \textit{T. C. Hales}, Discrete Comput. Geom. 25, No. 1, 1--22 (2001; Zbl 1007.52008) Full Text: DOI arXiv Online Encyclopedia of Integer Sequences: The ’Honeycomb’ or ’Beehive’ sequence: a(n) = ceiling(12^(1/4)*n).