Kobon triangle problem
Mathematical problem
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 lines.
Nº Q1269124 ★
Common · Knowledge
Kobon triangle problem
Mathematical problem
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 lines.
From Wikipedia
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 lines. Variations of the problem consider the projective plane rather than the Euclidean plane, and require that the triangles not be crossed by any other lines of the arrangement.
Text: Wikipédia, CC BY-SA 4.0. · Image: JocK at English Wikipedia (Public domain) ·
Related cards
-
Z
Zero-sum problem
Mathematical problem
Nº Q716171 ★
Not listed
-
No-three-in-line problem
Topic in discrete geometry
Nº Q6580594 ★
Not listed
-
Set cover problem
Classical problem in combinatorics
Nº Q1192100 ★
Not listed
-
Doubling the cube
Geometric problem of constructing a cube with twice the volume of a given cube
Nº Q213673 ★★
Not listed
-
Triangle
Basic three-sided shape of geometry
Nº Q19821 ★★★★
Not listed
-
Steiner tree problem
Class of problems in combinatorial mathematics
Nº Q1764144 ★
Not listed