# The Honeycomb Conjecture

@article{Hales2001TheHC,
title={The Honeycomb Conjecture},
author={Thomas C. Hales},
journal={Discrete \& Computational Geometry},
year={2001},
volume={25},
pages={1-22}
}
• T. Hales
• Published 8 June 1999
• Mathematics
• Discrete & Computational Geometry
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.
363 Citations
The Honeycomb Problem on the Sphere
The honeycomb problem on the sphere asks for the perimeter-minimizing partition of the sphere into N equal areas. This article solves the problem when N=12. The unique minimizer is a tiling of 12
The Least-Perimeter Partition of a Sphere into Four Equal Areas
We prove that the least-perimeter partition of the sphere into four regions of equal area is a tetrahedral partition.
On Hamiltonian Properties of Honeycomb Meshes
• Computer Science, Physics
• 2019
In this paper, we investigated Hamiltonian properties of honeycomb meshes which are created in two different ways. We obtained different Hamilton paths for Honeycomb Meshes for any dimension with
Certain hyperbolic regular polygonal tiles are isoperimetric
• Mathematics
Geometriae Dedicata
• 2021
The hexagon is the least-perimeter tile in the Euclidean plane. On hyperbolic surfaces, the isoperimetric problem differs for every given area. Cox conjectured that a regular $k$-gonal tile with
Least-Perimeter Partitions of the Sphere
We consider generalizations of the honeycomb problem to the sphere S and seek the perimeter-minimizing partition into n regions of equal area. We provide a new proof of Masters’ result that three
Perimeter-minimizing Tilings by Convex and Non-convex Pentagons
• Mathematics
• 2013
We study the presumably unnecessary convexity hypothesis in the theorem of Chung et al. [CFS] on perimeter-minimizing planar tilings by convex pentagons. We prove that the theorem holds without the
Approximation of Partitions of Least Perimeter by Γ-Convergence: Around Kelvin’s Conjecture
A numerical process to approximate optimal partitions in any dimension is reported to relax the problem into a functional framework based on the famous result of Γ-convergence obtained by Modica and Mortolla.
Planar clusters and perimeter bounds
• Mathematics
• 2005
We provide upper and lower bounds on the least-perimeter way to enclose and separate n regions of equal area in the plane (theorem 3.1). Along the way, inside the hexagonal honeycomb, we provide
On Generalizing the Honeycomb Theorem to Compact Hyperbolic Manifolds and the Sphere
• Mathematics
• 2006
We provide a possible alternate proof to the Honeycomb Conjecture in the plane. We generalize the proof of the hexagonal isoperimetric inequality to S and H under certain conditions and deduce that a

## References

SHOWING 1-10 OF 40 REFERENCES
Finite and Uniform Stability of Sphere Packings
• Mathematics
Discret. Comput. Geom.
• 1998
It is shown that many of the usual best-known candidates, for the most dense packings with congruent spherical balls, have the property of being uniformly stable, i.e., for a sufficiently small ε > 0 every finite rearrangement of the balls of this packing, where no ball is moved more than ε, is the identity rearrangements.
What are all the best sphere packings in low dimensions?
• Mathematics
Discret. Comput. Geom.
• 1995
We describe what may beall the best packings of nonoverlapping equal spheres in dimensionsn ≤10, where “best” means both having the highest density and not permitting any local improvement. For
Soap bubbles in ${\bf R}^2$ and in surfaces.
and in surfaces, i.e., the least-perimeter way to en-close and separate regions of prescribed area. They con-sist of constant-curvature arcs meeting in threes at 120degrees. If one prescribes the
SOAP BUBBLES IN R 2 AND IN SURFACES
We prove existence and regularity for "soap bubbles" in M2 and in surfaces, i.e., the least-perimeter way to enclose and separate regions of prescribed area. They consist of constant-curv ature arcs
The Kelvin problem : foam structures of minimal surface area
In 1887, Kelvin posed one of the most discussed scientific questions of the last 100 years - the problem of the division of three-dimensional space into cells of equal volume with minimal area. It
Geometric Measure Theory: A Beginner's Guide
Geometric Measure Theory: A Beginner's Guide, Fifth Edition provides the framework readers need to understand the structure of a crystal, a soap bubble cluster, or a universe. The book is essential
Unsolved Problems In Geometry
• Mathematics
• 1991
A monograph on geometry, each section in the book describes a problem or a group of related problems, capable of generalization of variation in many directions.
What the bees know and what they do not know
A honeycomb is defined as a set of congruent convex polyhedra, called cells, filling the space between two parallel planes without overlapping and without interstices in such a way that each cell has a face on one of two planes but does not have faces on both planes.
On the origin of the species
These laws, taken in the largest sense, being Growth with reproduction; Inheritance which is almost implied by reproduction; Variability from the indirect and direct action of the conditions of life,