WorksMathematics
Minimality of the Double Kite among Strict Two-Pole Configurations of Unit Triangles
Abstract
A strict unit-triangle configuration is a finite connected family of closed equilateral unit triangles in which distinct triangles are disjoint or meet at a common vertex, and no vertex belongs to more than two triangles. A vertex belonging to exactly one triangle is a pole. We prove that every strict configuration with one or two poles contains at least fourteen triangles, a sharp bound for two poles attained by the double kite and the reverse double kite. A strict four-regular configuration whose contact graph has an edge cut of size at most two contains at least twenty-eight triangles. A decomposition into three strict two-pole components requires forty-two triangles; both known ring constructions attain the bound. The proof reduces minimal counterexamples to two-connected contact graphs, applies area bounds to complementary unit-sided polygons, and excludes the remaining cases by exact angle certificates. The supplement contains 13,668 stored marked records, 233 exclusion certificates, a standard-library verifier, and independent checks of the complete enumeration.
Introduction
Harborth [2] constructed the symmetric vertex-to-vertex arrangement of forty-two unit triangles shown in Figure 1(a). Harborth and Möller later described the seven- and fourteen-triangle components as and , respectively [1 Fig. 1], and exhibited the complete packing assembled from three copies of [1 Fig. 3]. They explicitly stated the conjecture that forty-two is the smallest number of triangles in a complete vertex-to-vertex packing [1 p. 115]. A second, asymmetric forty-two-triangle arrangement, constructed by Winkler, Dinkelacker, and Vogel in 2017, is documented in Winkler’s catalog [7 v2, Fig. 1a]; the same catalog reproduces the symmetric ring in Figure 1b and shows the fourteen-triangle two-pole components in Figure 9. The asymmetric arrangement does not appear in Harborth and Möller’s 2002 paper. Both arrangements are strict: distinct triangles meet only at common vertices, each of which belongs to exactly two triangles. Each arrangement consists of six seven-triangle kites grouped into three fourteen-triangle two-pole components.

Figure 1. Two strict four-regular configurations, each containing forty-two unit triangles. (a) Harborth’s symmetric ring of three double kites [2], also shown as in [1 Fig. 3]. (b) An asymmetric ring of two double kites and one reverse double kite, constructed by Winkler, Dinkelacker, and Vogel in 2017 and documented in [7 v2, Fig. 1a]. The components called double kites and reverse double kites are shown in [7 v2, Fig. 9].
Thus strict four-regular configurations exist with forty-two unit triangles, while their minimum number remains unknown.
The configuration denoted by in [1] is the kite: it consists of seven unit triangles with three free corners, each belonging to one triangle; all other corners belong to two. If edges are drawn along the triangle sides, their degrees are two and four, respectively. The names kite, double kite, and reverse double kite were introduced by Winkler, Dinkelacker, and Vogel in [3 Sec. 2 and Fig. 1]. The double kite corresponds to in [1]. Joining two kites as in Figure 2 produces either double-kite configuration. Both have fourteen unit triangles, twenty-two distinct vertices, and exactly two vertices of degree two, called poles.

Figure 2. A seven-triangle kite and two fourteen-triangle configurations obtained by joining two copies. Orange and blue distinguish the two constituent kites; red dots mark the poles. The drawings use the exact constructions given in § 6.
The examples motivate a smaller extremal question: Can a connected strict two-pole configuration contain fewer than fourteen unit triangles? Theorem 1.2 answers this in the negative. Two-pole configurations arise naturally by separating a strict four-regular configuration along a two-edge cut of its contact graph. Our theorem therefore also bounds four-regular configurations whose contact graphs are not three-edge-connected (Corollary 6.3). For a cyclic union of three strict two-pole components it gives the sharp bound of forty-two triangles (Corollary 6.4). The unrestricted minimum for four-regular configurations remains open.
Planarity of a contact graph alone does not ensure a realization by unit triangles. Our proof reduces a minimal counterexample to a two-connected contact graph, derives necessary area inequalities for its complementary polygons, and excludes the remaining plane maps using exact angle certificates. The finite search ends at twelve triangles. We do not classify the fourteen-triangle configurations.
Definition 1.1. A strict unit-triangle configuration is a finite family of closed equilateral triangles of side length one in , satisfying the following conditions:
For distinct , either , or consists of one point that is a vertex of both triangles.
No point is a vertex of more than two triangles of .
The union is connected.
A vertex occurring in exactly one triangle is a pole. A configuration with poles is an -pole configuration. Its side graph has the distinct triangle corners as vertices and precisely the triangle sides as edges. At a pole its degree is two; at every other vertex its degree is four. A configuration without poles is called four-regular, referring to this side graph, not to the graph of all pairs of corners at unit distance. Such a configuration is a complete vertex-to-vertex packing in the terminology of Harborth and Möller [1].
The condition of strictness excludes shared edges, intersections in the relative interior of a triangle side, and overlapping triangles. We call the triangles black and the connected components of white faces. Contact angles are measured in degrees; trigonometric expressions for polygon areas use radians. The marked combinatorial cases used in the proof are defined in § 4.
Theorem 1.2. Every strict configuration with one or two poles contains at least fourteen unit triangles. For two poles this bound is attained.
Sections 2 and 3 develop the reduction and necessary geometric conditions. Sections 4 and 5 establish the finite exclusion; § 6 gives exact constructions attaining the bound. The cases with fourteen triangles are not enumerated.
Contact graphs and minimal-counterexample reduction
The contact graph of has one vertex for each black triangle and an edge for each common vertex of two triangles. It is connected if and only if the union of the triangles is connected. Its geometric embedding is obtained by joining the center of each triangle to its contact vertices. The two segments meeting at each contact give an embedded edge of . They lie in triangle interiors except at their common endpoint and consequently cannot cross.
Lemma 2.1 (Incidence and parity). If contains triangles, distinct vertices, and poles, then
If , the contact graph has vertices and edges.
Proof. Count the pairs consisting of a black triangle and one of its vertices. The non-poles each occur twice and the poles once, so . Each non-pole determines exactly one contact edge, and two triangles have at most one common point. Hence non-poles and contact-graph edges are in bijection.
For the lower bound it is useful to exclude one-pole configurations simultaneously. The following reduction avoids any assumption about the location of the poles in the unbounded face.
Lemma 2.2 (Minimal counterexample). Suppose there exists a strict configuration with one or two poles and at most thirteen triangles. Choose one with the smallest number of triangles. Then it has the following properties:
There are exactly two poles, lying in distinct nonadjacent triangles.
Its contact graph is simple and has no bridge. In particular, it is two-connected.
Its contact graph has two vertices of degree two, all other vertices have degree three, and .
Proof. Each connected component obtained by deleting triangles remains a strict configuration. Its poles are the retained original poles and the contact vertices freed by the deletions.
Suppose first that the configuration has a single pole in a triangle . The other two vertices of meet two distinct triangles and . After removing , every component contains or ; it has one or two poles, according as it contains one or both. This contradicts minimality.
If both poles lie in the same triangle , that triangle is a leaf of the contact graph. Deleting it leaves a connected configuration with exactly one pole. If the pole triangles are adjacent, each has one further contact. Removing both triangles yields one or two nonempty components, each with one or two poles. The new poles are distinct: if their contacts with the same third triangle coincided, that point would belong to three black triangles. If they lie in different third triangles, they are distinct because each vertex belongs to at most two triangles. Both possibilities contradict minimality.
Finally, suppose that an edge of the contact graph is a bridge. Cutting at its contact produces two connected strict configurations. Each acquires one new pole; the original two poles are divided between them. At least one side consequently has one or two poles, again contradicting minimality. Thus the graph has no bridge. A connected graph of maximum degree three without bridges has no cut vertex: otherwise one component at a cut vertex would be attached by only one edge. Hence the graph is two-connected. The degree sequence and the parity assertion follow from Lemma 2.1; the case is impossible for a simple contact graph.
Lemma 2.3 (White faces and their boundaries). In the setting of Lemma 2.2, the faces of the embedded contact graph correspond to the connected components of . Each such white face has a simple closed polygonal boundary consisting of unit sides of black triangles. Let be the length of its boundary cycle in the contact graph, and let be the number of poles belonging to its polygonal boundary. Then this boundary has
unit sides. The unbounded white face has a simple outer boundary, denoted by .
Proof. Join the center of every black triangle to its contact vertices by straight spokes. The spokes inside any one triangle do not cross, and spokes from distinct triangles meet only at
a prescribed contact; they give a planar embedding of the contact graph. The complement of this embedded graph consists of white regions together with the open sectors cut out by the spokes inside the black triangles. Each such black sector is adjacent to exactly one white component along its black side, or along the two consecutive black sides meeting at a pole. Attaching or removing these sectors does not join distinct white components. Thus the embedded graph faces correspond bijectively to the white faces.
The graph is two-connected by Lemma 2.2, so the facial walks are cycles with pairwise distinct graph vertices (see, e.g., [6]). Different edges of a facial cycle represent different contact points: otherwise at least three distinct black triangles would contain the same point, contrary to Definition 1.1. A facial cycle determines, in each triangle , the side joining its contacts with and ; if its pole lies in this face, the boundary instead traverses the two sides through that pole. At a degree-two triangle, the two center-to-contact spokes separate a sector containing its free corner and the two sides meeting there from a sector containing its remaining side. The two incident graph faces are distinct by two-connectivity; hence the pole belongs to exactly one of their white boundaries. No two nonconsecutive boundary sides can meet. Indeed, a nonconsecutive contact with a third triangle is at the unused third vertex of a degree-three triangle, not on the selected side; degree-two triangles have no third contact. Strictness forbids any other intersection of black sides. Free corners are distinct and cannot coincide with contacts. Hence the resulting boundary is a simple polygon.
A triangle without a pole contributes one unit side; a triangle with its pole on the face contributes two. Therefore its polygon has unit sides. Consecutive collinear unit sides are retained as separate sides, and their common angle is .
Geometric constraints on the white polygons
Set , the area of a unit equilateral triangle. For , put
The polygonal isoperimetric inequality states that a regular -gon maximizes the area among all simple -gons with fixed perimeter; in particular, a simple -gon with unit sides has area at most [5]. The relevant lower bound originates in the answer by Böröczky, Kertész, and Makai [4 Theorem 1] to a question of Harborth: a simple polygon with an odd number of unit sides has area at least . Their characterization of the infimum uses a triangle whose side lengths arise from signed integral sums of the prescribed side lengths. For an odd number of unit sides this yields a nondegenerate triangle with integer sides and odd perimeter; Heron’s formula gives area at least . The non-strict bound also applies when consecutive unit sides are collinear.
Lemma 3.1 (Weak area inequality). Let have the structural properties (1)–(3) of Lemma 2.2. Let denote the number of unit sides of its exterior boundary , and let be the number of bounded white faces with an odd number of sides. Then
Proof. The interior of is, up to sets of area zero, the disjoint union of the black triangles and the bounded white faces. Each black triangle has area , while each bounded odd-sided white face has area at least . This proves the first inequality. The polygonal isoperimetric inequality applied directly to the simple unit-sided polygon gives the second inequality.
An exterior pole permits a stronger area bound, by the boundary operation shown in Figure 4.

Figure 4. Cutting off an exterior pole ear. Replacing the boundary path –– by the third unit side removes exactly the black triangle , decreases the boundary length by one, and decreases the enclosed area by . The rest of the boundary may be nonconvex.
Lemma 3.2 (Exterior-pole ear inequality). Let be the number of poles lying on the exterior boundary of a configuration as in Lemma 2.2. Then
Proof. Consider a pole of the black triangle on . The boundary follows the two consecutive sides and . The third side is not a side of : it borders the other white face incident with , which is distinct by two-connectivity. Strictness prevents any other boundary side from meeting its relative interior. Therefore is an interior diagonal of . Replacing by produces another simple polygon, with one fewer unit side and with area smaller by exactly , as in Figure 4.
If both poles are exterior, their black triangles are disjoint by Lemma 2.2. Thus the second ear remains available after the first is removed; the resulting polygon is still simple. After removals the polygon encloses the other black triangles and all bounded white faces. Moreover, , since the exterior facial boundary of the simple two-connected contact graph is a cycle. Thus is defined, and the lower area bound and the isoperimetric upper bound give (5).
For the angular model we fix a counterclockwise cyclic order of neighbors at each vertex. A directed contact , or dart, belongs to the face obtained by following the successor of in the cyclic order at . Denote by the white angle at the contact in that face. Angles are in degrees.
Lemma 3.3 (Pole elimination and reduced face angles). Let be a white face with facial cycle of length . For each pole lying on its boundary, let be the corresponding black triangle, where are its contacts. Replacing the boundary path by the unit segment , for every such pole, produces a simple polygon with unit sides and with precisely the contact points as vertices.
For a dart of , let be the number of eliminated pole corners adjacent to its contact, and let denote the interior angle of at that point. Then and
Moreover, .
Proof. The contact graph is two-connected. The side borders the other face incident with the degree-two vertex , hence is not part of the boundary of . By strictness its relative
interior does not meet any other boundary side. In a bounded white face, adjoining the interior of fills in a triangular notch; for the exterior face, replacing the two boundary sides cuts the triangular ear off the bounded region enclosed by its outer boundary. The Jordan curve theorem implies in either case that the new polygon is simple.
The two pole triangles of a minimal counterexample are nonadjacent, hence disjoint. Consequently these operations do not interfere even when both poles belong to the same face. Removing one pole adds to each of the two interior angles at its contacts in the bounded-face case. For the exterior polygon it decreases the corresponding polygon angles by . At a contact there can be at most one adjacent pole triangle, because the pole triangles are nonadjacent. This proves (6); counting the two endpoints of every removed ear gives the last identity.
Lemma 3.4 (Contact and face equations). For every edge of the contact graph,
If a white face has a contact-graph boundary cycle of length and contains poles on its polygonal boundary, then
Proof. At a contact the two black angles are , so the two complementary white sectors sum to (Figure 3). A sector of zero angle would force two unit sides of different triangles to overlap, contrary to strictness. Apply Lemma 3.3. The angles of the reduced -gon sum to . Substituting (6) and gives both instances of (8).

Figure 3. Two black triangles meeting at one contact. The white sectors satisfy , and their sum is . The strict inequalities follow from the prohibition of overlapping unit sides.
Lemma 3.5 (Three-cycles). Every three-cycle of the contact graph surrounds a white unit equilateral triangle. Two three-cycles cannot share a vertex.
Proof. If three black triangles are pairwise in contact, their three distinct contact points are vertices of each participating black triangle in pairs. The segments joining these points are therefore three black unit sides and form an equilateral triangle. Its interior is white: a black triangle occupying it would share a full side with one of the three given triangles, while a triangle crossing its boundary would violate strictness. Hence the three white angles are . The resulting arrangement is the three-triangle block shown in Figure 5.
If two three-cycles shared a vertex in a graph of maximum degree three, they would share an edge. The two white faces on the two sides of that contact would both have angle , contradicting (7).
Figure 5. A single black unit triangle and a three-triangle block surrounding a white unit triangle. The central white triangle corresponds to a three-cycle of the contact graph.
After pole elimination, a white face is represented by the polygon of Lemma 3.3. We may contract a corner whose interior angle is proved to be , replacing its two collinear unit-sided chains by a single side with length equal to their sum. All remaining side lengths are positive integers.
Lemma 3.6 (Contracted-polygon conditions). Consider a simple white-face boundary after eliminating its pole corners and deleting any vertices known to have interior angle . Label its vertices cyclically , with the positive integer length of the side (indices modulo ).
It has and .
If , its angles are determined by the cosine rule.
If , , and , then and are the apex vertices, and are the base vertices, and the two base angles are equal. This includes rhombi and nonconvex kite quadrilaterals.
Suppose an angle has adjacent side lengths , and the opposite chain has lengths . Put and . If , then
Proof. The strict polygon inequality in (1) follows by viewing a side as one part of a noncollinear closed chain. Part (2) is the cosine rule. For (3), reflection in the line through the apex vertices exchanges the base vertices and their angles. The chain joining the neighbors of the angle in (4) has endpoint distance at least , by the reverse triangle inequality. The strict polygon inequality gives , hence . Together with the assumption , this shows that the argument of arccos in (9) lies in . Apply the cosine rule to the two sides and this endpoint distance. The two possible orientations give the stated interval, which also covers reflex angles.
Definition 3.7 (Forced-angle closure). For each face, retain the reduced corner expressions of (6), where and is an integral multiple of . Starting with no fixed angle values, repeatedly apply the following rules:
(R1) In a nondegenerate contracted triangle, the cosine rule determines each remaining corner. If its cosine equals , record .
(R2) If , record .
(R3) Contract every corner known to satisfy , adding the lengths of adjacent sides. Record a contradiction if the resulting polygon has at most two corners or fails the strict polygon inequality.
Iterate until no additional fixed angle or contradiction is obtained. A forced value contradicts strictness.
Lemma 3.8 (Soundness of closure). Every fixed angle obtained by rules (R1)–(R3) holds in every realization of the marked case. Every recorded polygon contradiction excludes such a realization.
Proof. Induct on the order in which facts are obtained. Initially there are no claims. Suppose all previously recorded angle values hold in a realization. Deleting a known straight corner leaves the same simple polygonal boundary and combines its two collinear sides into one side whose length is their sum. The cosine rule then gives (R1); the contact equation (7) gives (R2). Rule (R3) is necessary for any nondegenerate simple polygon by Lemma 3.6(1). Each rule therefore preserves necessity. Only finitely many corners can be fixed or removed, so the procedure terminates. A forced value of zero, 240, or outside that interval contradicts (7).
Finite enumeration
By Lemmas 2.2, 2.3, and 3.5, a minimal counterexample with fewer than fourteen triangles has a simple, two-connected planar contact graph of even order . Exactly two nonadjacent vertices have degree two; all other vertices have degree three, and distinct three-cycles are vertex-disjoint. We enumerate the graphs and their marked planar embeddings.
The generator first enumerates all connected graphs of maximum degree three on at most twelve vertices, modulo isomorphism. For completeness, observe that every connected graph on at least two vertices has a vertex that is not a cut vertex. Removing it leaves a connected graph of maximum degree three. Conversely, a graph is recovered by adjoining a new vertex to a nonempty subset of at most three vertices of degree at most two. Starting from a single vertex and generating all such extensions is therefore exhaustive. Two implementations use different isomorphism machinery: nauty and the VF2 algorithm in NetworkX.
For each surviving graph, the generator examines all cyclic orders of neighbors and retains only rotation systems of genus zero, as determined by Euler’s formula. These give all spherical maps up to graph isomorphism and global reversal of the cyclic orders. Each face is considered as a possible exterior face. For each of the two degree-two vertices, either incident face may contain its free corner. A marked case records the rotation system, an outer-face dart, and two pole-face darts. If a map has faces, all choices are retained as stored records; marked classes identify choices equivalent under graph isomorphism and global reversal.
In the census, Polygon denotes a degenerate contracted polygon or a violation of its strict polygon inequality. An inadmissible forced-angle value may instead be recorded as a FIX row of a linear certificate. These categories distinguish the first archived witness, not mutually exclusive contradictions.
For the only candidate is , whose two three-cycles share an edge. Lemma 3.5 excludes this case before geometric enumeration. The reductions are summarized in Table 1; Table 2 records the successive geometric tests. All counts can be reproduced from the archived data. Every hypothetical realization is represented by a marked class: its embedding fixes a rotation system, an exterior face, and a face containing each pole. Global reversal may be factored out because reflection preserves strict realizability.
| Two-connected | Admissible | Maps | Marked classes | Stored records | |
| 6 | 3 | 3 | 4 | 30 | 64 |
| 8 | 13 | 9 | 12 | 166 | 240 |
| 10 | 83 | 47 | 68 | 1 257 | 1 632 |
| 12 | 639 | 272 | 419 | 10 453 | 11 732 |
Table 1. Combinatorial census. “Two-connected” counts simple two-connected graphs with degree sequence whose degree-two vertices are nonadjacent. “Admissible” additionally requires planarity and pairwise vertex-disjoint three-cycles. “Maps” counts genus-zero rotation systems modulo graph isomorphism and global reversal. Marked classes use the same symmetries; stored records retain individual markings.
| Stored records | Area | Exterior ears | Polygon | Linear certificate | |
| 6 | 64 | 59 | 1 | 4 | 0 |
| 8 | 240 | 230 | 5 | 4 | 1 |
| 10 | 1 632 | 1 577 | 31 | 18 | 6 |
| 12 | 11 732 | 11 380 | 152 | 175 | 25 |
| Total | 13 668 | 13 246 | 189 | 201 | 32 |
Table 2. Exhaustive geometric exclusions for . Each stored record is assigned its first successful test. “Polygon” counts geometric polygon contradictions; “Linear certificate” includes witnesses involving inadmissible forced-angle values.
Exact exclusion certificates
For a stored record, let be the number of unit sides of the outer boundary, the number of exterior poles, and the number of bounded odd-sided white faces. The first two computational tests are direct consequences of Lemmas 3.1 and 3.2:
The implementation rejects a case only when rational strict comparisons establish the failure of (10) or (11). Equality is not a rejection; in particular . The rational estimates
are sufficient. Upper bounds for follow from and for , together with simple exact bounds for small . Thus no floating-point calculation determines whether a case is rejected.
Table 2 shows that these two filters discard 13 435 cases, leaving 233. For 201 of these cases, the closure rules of Definition 3.7 yield a polygon with fewer than three corners or with side lengths violating the strict polygon inequality. Each of these semantic certificates identifies a face and a verifiable contradiction.
The other 32 cases are excluded by rational linear certificates in the contact angles . For each fixed , record indices are zero-based positions in data/cases_tXX.json, with matching certificates at the same positions in data/certs_tXX.json, where XX is the two-digit triangle count. The tests run in the order area, exterior ears, contracted polygon, linear certificate. A CDEG certificate stores a witness dart for a degenerate contracted polygon. Each linear row expresses a necessary geometric condition:
FIX: a forced rational angle obtained by rules (R1)–(R2), including values at or outside the admissible interval (which already imply a contradiction);
QEQ: equality of opposite base angles in a kite or rhombus;
HI: a rational bound from the triangle cosine rule;
CHL: a rational bound derived from (9).
Lemma 5.1 (Exact linear exclusion). Suppose the geometric rules yield equalities , inequalities , and for every variable. Choose rational , arbitrary in sign, and rational . Set
If , or if and , then the marked case is not geometrically realizable.
Proof. For a feasible , direct substitution gives
The left side is nonnegative; it is strictly positive if , by the strict angular bounds. Either hypothesis is a contradiction.
All certificate multipliers are rational, and all rows are independently reconstructed from the marked map before the above inequality is checked. Eight certificates use , which follows immediately from . The only other trigonometric constant occurring in a retained angular certificate is . Hence the angular certificate checker needs no approximation of or transcendental function.
Example 5.2. (A collapsed polygon). The stored record of index 36 for has the bounded face with dart cycle
The exact closure forces . Removing these two straight corners leaves only the two contact corners (2, 4) and (5, 3), with successive side lengths (2, 2). No nondegenerate simple polygon can have two corners, so the record is excluded by a CDEG certificate whose witness is the dart (2, 4).
Example 5.3. (An exact linear contradiction). For , the stored record of index 146 can be excluded using nineteen linear equations: eleven contact-angle equations, two face-angle equations, and six equalities between opposite angles in unit rhombi. Using the vertex labels of the archived marked map, their row identifiers, in order, are
Here denotes the ordered dart , and identifies the equation . The two face rows have the following dart cycles and parameters:
Their face-equation right-hand sides are and , respectively, by (8). Multiply the three groups of equations respectively by
All angle coefficients cancel, while the constants sum to . Thus the equations imply , a contradiction. This certificate requires no angular inequalities. The electronic record contains the negatives of the displayed multipliers, so that its verifier obtains in Lemma 5.1.
Proposition 5.4. (Finite exclusion). No strict configuration having the structural properties (1)–(3) of Lemma 2.2 has triangles.
Proof. The exhaustive graph and embedding generation in § 4 produces the marked cases in Table 2. By the first two verified tests, 13 435 cases violate a necessary area inequality. Of the 233 remaining cases, the supplementary standard-library verifier validates 201 contracted-polygon contradictions and 32 rational certificates, using Lemmas 3.4, 3.5, 3.6, and 5.1. Each marked case is therefore excluded. The enumeration is exhaustive by the vertex-extension argument and the complete enumeration of planar rotation systems, outer faces, and pole sectors.
Remark 5.5 (Reproducibility). The electronic supplement [8] provides four case lists, four certificate lists, and the standard-library verifier check233_stdlib.py for Proposition 5.4. The verifier checks vertex labels, degree sequences, adjacency, two-connectivity, vertex-disjointness of three-cycles, planar facial cycles, graph6 encodings, pole incidence, certificate indices, and record counts before applying the geometric rules. Independent graph generators, one without nauty, and bidirectional comparisons of planar maps and marked classes establish the completeness of the lists. A separate implementation independently checks all 233 geometric certificates; its programs and logs are supplied. The exact constructions of the fourteen-triangle configurations are verified by check_D_stdlib.py, also using the Python standard library.
Exact fourteen-triangle constructions
We give exact coordinates for the double kite and the reverse double kite. Let
where denotes rotation through about the origin. Both and are equilateral triangles of side length two. For any such large triangle , let denote the three unit corner triangles with vertices
The seven-triangle kite is
Here the unions are unions of families of triangles. Let be reflection in the line through and . Set
The reverse double kite is obtained by the half-turn , whose center is the midpoint of and $b_2:
Both configurations are shown in Figure 2.
Proposition 6.1. Each of the families and defined by (13)–(15) is a strict connected configuration with fourteen unit triangles and exactly two poles.
Figure 6. The double kite , obtained by reflecting a seven-triangle kite across the dashed line (Proposition 6.1). Orange and blue distinguish the two constituent kites, as in Figure 2. The red points are the poles and . The drawing uses decimal evaluations of the exact coordinates in (13)–(14).
Proof. The two large triangles in (13) have side length two, hence each of their six corner triangles has unit sides. Moreover, is equilateral with unit sides. Reflection and the half-turn preserve these lengths. Thus both families consist of fourteen unit triangles.
All coordinates lie in . In either family, exact coordinate comparisons give 22 distinct vertices, 20 of multiplicity two and precisely two of multiplicity one: for , and for . Orientation and segment-intersection predicates verify that any two distinct triangles are disjoint or meet at a common vertex, and that the 20 contacts give a connected contact graph. The supplementary standard-library program check_D_stdlib.py checks these claims for both configurations using exact fractions in . Orientation signs are determined by rational isolating intervals, without numerical tolerances.
Proof of Theorem 1.2. Suppose a strict configuration with one or two poles and fewer than fourteen triangles exists. Then the class of strict configurations with one or two poles and at most thirteen triangles is nonempty. Choose a minimum member. By Lemma 2.2, it has even triangle count at most twelve and satisfies all structural assumptions of Proposition 5.4, a contradiction. Proposition 6.1 shows that both double-kite constructions attain the lower bound.
Corollary 6.2. Every strict one-pole configuration contains at least fifteen triangles, if such a configuration exists.
Proof. By Theorem 1.2 a one-pole configuration contains at least fourteen triangles. Its number of triangles is odd by Lemma 2.1.
Corollary 6.3 (Small edge cuts). Let be a strict configuration without poles, and let be its contact graph. If is not three-edge-connected, then contains at least twenty-eight unit triangles. If has a bridge, then contains at least thirty triangles.
Proof. The contact graph is cubic. A bridge separates it into two connected subgraphs; each determines a strict one-pole configuration after the contact is cut. Corollary 6.2 gives at least fifteen triangles on either side. Otherwise, a minimal two-edge cut separates into two connected subgraphs, each defining a strict two-pole configuration. The two newly free contacts are distinct because the original configuration is strict. Theorem 1.2 gives at least fourteen triangles on either side.
Corollary 6.4 (Decompositions into two-pole configurations). Suppose a strict four-regular unit-triangle configuration is the union of strict two-pole configurations whose triangle
families are pairwise disjoint. Then it contains at least unit triangles. In particular, a decomposition into three such components requires at least forty-two triangles, and this bound is attained by both configurations in Figure 1.
Proof. The number of unit triangles is the sum of the sizes of the component families. Each has at least fourteen triangles by Theorem 1.2, which proves the lower bound.
To verify sharpness for , first consider the double kite from (14), with poles and . Let be counterclockwise rotation through about the origin, and define
Then . The three families , , and form Harborth’s ring. The exact computation in src/check_ring42_DDD.py establishes strictness, connectivity, and the fact that each of its sixty-three vertices belongs to exactly two triangles. The clockwise rotation instead makes the three copies overlap.
For the asymmetric example, take two copies of and one copy of from (15). Their squared pole separations, calculated from the exact coordinates, are
In particular, . Put
The sides , , and have lengths . Take the three ordered components , with ordered poles , , and , respectively. Map each component by the unique orientation-preserving isometry sending its first pole to and its second to (indices modulo three), without reflecting the component. This is exactly the placement with mirror=(0,0,0) and orient=(0,0,0) in src/check_ring42_balls.py. The interval certificates establish that these three images are a strict ring of forty-two triangles and sixty-three doubly occupied vertices. Hence both rings attain the bound.
Verification and scope
Theorem 1.2 gives the sharp minimum for strict two-pole configurations, but does not classify the configurations attaining it. Shared edges or contacts in the relative interior of a triangle side are excluded by Definition 1.1. Corollary 6.3 applies to strict four-regular configurations whose contact graphs have an edge cut of size one or two; Corollary 6.4 gives a componentwise bound for specified decompositions. Whether two two-pole components can form a strict four-regular configuration remains open, as does the minimum size among configurations with three-edge-connected contact graphs.
The file DoubleKite_Minimality_Supplement_v1.0_2026-11-09.zip is the electronic supplement archived at Zenodo (version 1.0, November 9, 2026; https://doi.org/10.5281/zenodo.24093082). It contains every marked case, the exclusion certificates and their verifier, the independent enumeration and audit programs, and tests of the exact fourteen-triangle constructions and both forty-two-triangle rings. The DDD ring is verified using exact field arithmetic; the asymmetric DDR ring is verified by certified interval arithmetic. The accompanying README specifies dependencies and reproduction commands.
Computational and AI assistance. Claude (Anthropic, Opus 5.5), ChatGPT (OpenAI, GPT-6), and Gemini (Google, Argon) were used during computational exploration, certificate verification, and preparation of the manuscript. Claude contributed to graph enumeration and certificate construction and later performed a code-based completeness audit using a separate nauty-free generator and independently implemented geometric tests. ChatGPT assisted with the area-filter and certificate-checker audits, exact-coordinate verification, and exposition. Gemini provided a referee-style critique and a partial independent checking program. The graph-reduction strategy, geometric exclusion rules, and certificate representation were developed in an iterative process with Claude and ChatGPT under the author’s direction. The author checked and takes responsibility for the mathematical claims, the reproducible programs, and the submitted text.
References
- [1]H. Harborth and M. Möller, Complete vertex-to-vertex packings of congruent equilateral triangles, Geombinatorics 11 (2002), no. 4, 115–118.DOI
- [2]H. Harborth, Plane four-regular graphs with vertex-to-vertex unit triangles, Discrete Mathematics 97 (1991), 219–222. doi:10.1016/0012-365X(91)90437-7.DOI
- [3]M. Winkler, P. Dinkelacker, and S. Vogel, New minimal (4; n)-regular matchstick graphs, Geombinatorics 27 (2017), no. 1, 26–44; https://arxiv.org/abs/1604.07134.
- [4]K. Böröczky, G. Kertész, and E. Makai, Jr., The minimum area of a simple polygon with given side lengths, Periodica Mathematica Hungarica 39 (2000), 33–49. doi:10.1023/A:1004830604712.DOI
- [5]V. Blåsjö, The isoperimetric problem, American Mathematical Monthly 112 (2005), no. 6, 526–566. doi:10.2307/30037526.
- [6]R. Diestel, Graph Theory, 5th ed., Springer, 2017.
- [7]M. Winkler, A catalogue of 4-regular and (2,4)-regular matchstick graphs, arXiv:1705.04715v2 (May 25, 2017).arxiv.org/abs/1705.04715
- [8]M. Winkler, Proof certificates and verification programs for “Minimality of the Double Kite among Strict Two-Pole Configurations of Unit Triangles”, software and data supplement, version 1.0, Zenodo, November 9, 2026. doi:10.5281/zenodo.24093082.DOI

