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 ★
Comum · Saberes
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.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
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.
Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: JocK at English Wikipedia (Public domain) ·
Cartas próximas
-
Z
Zero-sum problem
Mathematical problem
Nº Q716171 ★
Sem ofertas
-
No-three-in-line problem
Topic in discrete geometry
Nº Q6580594 ★
Sem ofertas
-
Problema de cobertura de conjuntos
Nº Q1192100 ★
Sem ofertas
-
Duplicação do cubo
Um problema de geometria
Nº Q213673 ★★
Sem ofertas
-
Triângulo
Forma geométrica com 3 lados
Nº Q19821 ★★★★
Sem ofertas
-
Problema da árvore de Steiner
Nº Q1764144 ★
Sem ofertas