Combinatorics and Graph Theory


Tiling Hexagons with Smaller Hexagons and Unit Triangles

Authors: Richard J. Mathar

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.

Comments: 10 pages are Java source code distributed under the LGPL 3.

Download: PDF

Submission history

[v1] 2016-08-28 11:00:45

Unique-IP document downloads: 475 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus