The Kobon triangle problem is an unsolved problem in
combinatorial geometry
Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geome ...
first stated by
Kobon Fujimura
The Kobon triangle problem is an unsolved problem in combinatorial geometry first stated by Kobon Fujimura (1903-1983). The problem asks for the largest number ''N''(''k'') of nonoverlapping triangles whose sides lie on an arrangement of ''k'' ...
(1903-1983). The problem asks for the largest number ''N''(''k'') of nonoverlapping triangles whose sides lie on an
arrangement of ''k'' lines. Variations of the problem consider the
projective plane
In mathematics, a projective plane is a geometric structure that extends the concept of a plane. In the ordinary Euclidean plane, two lines typically intersect in a single point, but there are some pairs of lines (namely, parallel lines) that ...
rather than the Euclidean plane, and require that the triangles not be crossed by any other lines of the arrangement.
[.]
Known upper bounds
Saburo Tamura proved that the number of nonoverlapping triangles realizable by
lines is at most
. G. Clément and J. Bader proved more strongly that this bound cannot be achieved when
is congruent to 0 or 2 (mod 6).
The maximum number of triangles is therefore at most one less in these cases. The same bounds can be equivalently stated, without use of the
floor function
In mathematics and computer science, the floor function is the function that takes as input a real number , and gives as output the greatest integer less than or equal to , denoted or . Similarly, the ceiling function maps to the least ...
, as:
Solutions yielding this number of triangles are known when
is 3, 4, 5, 6, 7, 8, 9, 13, 15 or 17.
Ed Pegg Jr. on Math Games
/ref> For ''k'' = 10, 11 and 12, the best solutions known reach a number of triangles one less than the upper bound.
Known constructions
Given a perfect solution with ''k''0 > 3 lines, other Kobon triangle solution numbers can be found for all ''ki''-values where
by using the procedure by D. Forge and J. L. Ramirez Alfonsin. For example, the solution for ''k''0 = 5 leads to the maximal number of nonoverlapping triangles for ''k'' = 5, 9, 17, 33, 65, ....
Examples
Image:KobonTriangle_3.svg, 3 straight lines result in one triangle
Image:KobonTriangle_4.svg, 4 straight lines
Image:KobonTriangle_5.svg, 5 straight lines
Image:KobonTriangle_6.svg, 6 straight lines
Image:KobonTriangle_7.svg, 7 straight lines
See also
*Roberts's triangle theorem
Roberts's triangle theorem, a result in discrete geometry, states that every simple arrangement of n lines has at least n-2 triangular faces. Thus, three lines form a triangle, four lines form at least two triangles, five lines form at least thr ...
, on the minimum number of triangles that lines can form
References
{{Reflist
External links
*Johannes Bader
"Kobon Triangles"
Discrete geometry
Unsolved problems in geometry
Recreational mathematics
Triangles