An edge-minimization problem for regular polygons (Q2380245)

The authors examine the following problem: What is the minimum number of unit edges required to construct \(k\) congruent regular polygons in the plane if sharing of edges is allowed? The problem was solved for the square, the equilateral triangle, and the regular hexagon by \textit{F.~Harary} and \textit{H.~Harborth} in [``Extremal animals,'' J. Comb. Inf. Syst. Sci. 1, 1--8 (1976; Zbl 0402.05055)]. In the paper under review asymptotically optimal configurations of regular \(n\)-gons for all \(n\) are obtained.