TOPICS
Search

Kobon Triangle


KobonTriangles

A Kobon triangle is a triangular region in an arrangement of straight lines. The Kobon triangle problem asks for the largest number N(n) of nonoverlapping triangles that can be constructed using n lines (Fujimura 1978; Gardner 1983, p. 170). While it appears to be very difficult to find an analytic expression for the general nth term, upper bounds are known. The first few known terms for n=3, 4, ... are 1, 2, 5, 7, 11, 15, 21, 25, 32, 38, 47, ... (OEIS A006066).

KobonTriangle10

A. Wajnberg (pers. comm., Nov. 18, 2005) found a configuration for n=10 containing 25 triangles (left figure). A different 10-line, 25-triangle construction was found by Grünbaum (2003, p. 400), and a third configuration is referenced by Honma. Two other distinct solutions were found in 1996 by Grabarchuk and Kabanovitch (Kabanovitch 1999, Pegg 2006).

Kobon11-12-13

Honma illustrated an 11-line, 32-triangle configuration and another solution was found by Kabanovitch (1999; Pegg 2006). Savchuk (2025) ruled out 33 triangles for simple arrangements. Parpalak and Utkin (2026b) also ruled out 33 when three or more lines may meet at a point, establishing N(11)=32.

Kabanovitch (1999) also found a 12-line, 38-triangle configuration, and a 13-line 47-triangle configuration (Pegg 2006).

KobonTriangle14

Maiorana (2026) and, independently, Parpalak and Utkin (2026b) found 14-line arrangements with 54 triangular faces. The figure shows Maiorana's first arrangement using coordinates supplied by E. Pegg, Jr. (pers. comm., Nov. 6, 2026). The highlighted points are the two triple points. Parpalak and Utkin (2026b) ruled out 55 or more such faces even for arrangements of pseudolines, so N(14)=54.

KobonTriangle15

T. Suzuki (pers. comm., Oct. 2, 2005) found the above configuration for n=15.

A number of other configurations that are either maximal or the best known are summarized and linked to on the page for the sequence OEIS A006066 in the Online Encyclopedia of Integer Sequences. Savchuk (2025) enumerated all possible Kobon arrangements for n=3, 5, 9, 15, and 17 and also found new optimal Kobon arrangements for 23 and 27 lines.

The simplest bound was found by Saburo Tamura, who showed that for n>=4,

 N(n)<=|_(n(n-2))/3_|
(1)

(Felsner and Kriegel 1999, Clément and Bader 2007), where |_x_| is the floor function. Clément and Bader (2007) proposed tightening Tamura's bound by one for n=0,2 (mod 6). Their proof has a gap. The common point of the three medians of a triangle belongs to six pairs of triangles sharing a side in the arrangement of the medians and sides, whereas their argument allows at most two. The expression (n^2-2n-2)/3 for n=1,4 (mod 6) was also printed incorrectly as (n-1)^2/3 in their paper.

For a simple arrangement every pair of lines intersects and no three meet at one point. For even n, the maximum number N_s(n) of triangular regions in such an arrangement satisfies the bound of Bartholdi et al. (2007) and the stronger bound of Blanc (2011),

 N_s(n)<=|_n/3(n-7/3)_|
(2)

and

 N_s(n)<=|_n/3(n-5/2)_|.
(3)

Blanc's bound is exceeded by some arrangements with triple points. In particular, Parpalak and Utkin (2026b) constructed arrangements with n=6·2^t+2 for t>=0 having two triple points and (n(n-5/2)+1)/3 triangles, one more than Blanc's bound.

The following table compares Tamura's general upper bound, the proposed Clément-Bader bound, and the two upper bounds for simple arrangements.

nOEIS34567891011121314151617181920
Tamura boundA0327651258111621263340475665748596107120
Clément-Bader proposed1257111521263339475565748595107119
Bartholdi et al. bound27152538547294117
Blanc bound27142538537293116

Exact values are known for some special forms of n, with t a nonnegative integer (Bartholdi et al. 2007, Parpalak and Utkin 2026a).

nN(n)
2·2^t+1(n(n-2))/3
14·2^t+1(n(n-2))/3
18·2^t+1(n(n-2)-2)/3
6·2^t+1(n(n-2)-2)/3

Parpalak and Utkin (2026b) also established unrestricted upper bounds matching the known constructions for 6, 8, 10, and 12 lines.

Bader's 16-line construction with 72 triangles reaches the simple bound (Bader, Bartholdi et al. 2007, Blanc 2011). For unrestricted arrangements, these results give 72<=N(16)<=74, using Tamura's bound for the upper limit. Parpalak and Utkin (2026b, Fig. B.8) constructed an arrangement of 20 lines that gives the lower bound N(20)>=117.

Known exact values of N(n) for n<50 are summarized in the following table.

nN(n)commentreference
312·2^t+1
42upper limit construction
552·2^t+1
67upper limit construction
7116·2^t+1
815upper limit construction
9212·2^t+1
1025upper limit constructionKabanovitch (1999), Grabarchuk, Grünbaum (2003), Wajnberg (pers. comm., 2005)
1132exhaustive upper boundSavchuk (2025), Parpalak and Utkin (2026b)
1238upper limit constructionKabanovitch (1999)
13476·2^t+1
1454exhaustive upper boundMaiorana (2026), Parpalak and Utkin (2026b)
156514·2^t+1Suzuki (pers. comm., 2005)
17852·2^t+1Clément and Bader (2007)
19107upper limit constructionWood
21133upper limit constructionSavchuk (2025)
23161upper limit constructionSavchuk (2025)
251916·2^t+1
27225upper limit constructionSavchuk (2025)
2926114·2^t+1
31299upper limit constructionWood
333412·2^t+1
35385upper limit constructionUtkin and Parpalak (2026)
3743118·2^t+1Parpalak and Utkin (2026a)
41533upper limit constructionParpalak and Utkin (2026a)
43587upper limit constructionUtkin and Parpalak (2026)
45645upper limit constructionParpalak and Utkin (2026a)
497676·2^t+1

See also

Configuration, Projective Plane, Triangle

Explore with Wolfram|Alpha

References

Bader, J. "Kobon Triangles." https://sop.tik.ee.ethz.ch/people/baderj/other.html.Bartholdi, N.; Blanc, J.; and Loisel, S. "On Simple Arrangements of Lines and Pseudo-Lines in P^2 and R^2 with the Maximum Number of Triangles." 5 Jun 2007. https://arxiv.org/abs/0706.0723.Blanc, J. "The Best Polynomial Bounds for the Number of Triangles in a Simple Arrangement of n Pseudo-Lines." Geombinatorics 21, 5-14, 2011. https://algebra.dmi.unibas.ch/blanc/articles/bestbound.pdf.Clément, G. and Bader, J. "Tighter Upper Bound for the Number of Kobon Triangles." Dec. 21, 2007. https://oeis.org/A006066/a006066.pdf.Eppstein, D. "Kabon Triangles." https://ics.uci.edu/~eppstein/junkyard/triangulation.html.Felsner, S. and Kriegel, K. "Triangles in Euclidean Arrangements." Disc. Comput. Geom. 22, 429-438, 1999. https://doi.org/10.1007/PL00009471.Fujimura, K. "The Tokyo Puzzle Charles." New York: Scribner's Sons, 1978.Gardner, M. Wheels, Life, and Other Mathematical Amusements. New York: W. H. Freeman, pp. 170-171 and 178, 1983.Grünbaum, B. Arrangements and Spreads. Providence, RI: Amer. Math. Soc., 1972.Grünbaum, B. Convex Polytopes, 2nd ed. New York: Springer-Verlag, p. 400, 2003.Honma, S. "Kobon Triangles." http://www004.upp.so-net.ne.jp/s_honma/triangle/triangle2.htm.Kabanovitch, V. "Kobon Triangle Solutions." Sharada (Charade, publication of the Russian puzzle club Diogen) 6, 1-2, June 1999.Maiorana, A. "Kobon Triangles for k=14." 2026. https://github.com/rufio72/kobon_triangles_k14.Parpalak, R. and Utkin, D. "The 18·2^t+1 Triangle-Maximal Series of Straight Lines." 23 Apr 2026a. https://arxiv.org/abs/2604.22035.Parpalak, R. and Utkin, D. "Non-Simple Arrangements of Lines and Pseudolines with Many Triangles." 2 Nov 2026b. https://arxiv.org/abs/2611.03096.Pegg, E. Jr. "Math Games: Kobon Triangles." Feb. 8, 2006. https://www.mathpuzzle.com/MAA/45-Kobon/mathgames_02_08_06.html.Prieto-Martínez, L. F. "A List of Problems in Plane Geometry with Simple Statement That Remain Unsolved." 16 Apr 2021. https://arxiv.org/abs/2104.09324.Savchuk, P. "Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening." 10 Jul 2025. https://arxiv.org/abs/2507.07951.Utkin, D. and Parpalak, R. "Kobon & Arnold Solution Gallery." 2026. https://ud1.github.io/kobon-solutions/gallery/.Sloane, N. J. A. Sequences A006066/M1334 and A032765 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Kobon Triangle

Cite this as:

Weisstein, Eric W. "Kobon Triangle." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/KobonTriangle.html

Subject classifications