Authors: Richard J. Mathar
Comments: 10 pages are Java source code distributed under the LGPL 3.
This is a numerical study of the combinatorial problem of packing hexagons of some equal size
into a larger hexagon. The problem is well defined if all hexagon edges have integer length
and if their centers and vertices share the common lattice points of a triangular grid with unit distances.
Category: Combinatorics and Graph Theory