ArticleslgStudy

mathematics

Kobon triangle problem

Kobon triangle problem is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Kobon triangle problem rather than just read about it. In short: 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.

Kobon triangle problem — main illustration
Kobon triangle problem — illustration

Key takeaways

  • Kobon triangle problem belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Kobon triangle problem to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Kobon triangle problem from memory before moving on to harder problems.

Reference excerpt

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.

Known upper bounds Saburo Tamura proved that the number of nonoverlapping triangles realizable by k {\displaystyle k} lines is at most ⌊ k ( k − 2 ) / 3 ⌋ {\displaystyle \lfloor k(k-2)/3\rfloor } . G. Clément and J. Bader proved more strongly that this bound cannot be achieved when k {\displaystyle k} is congruent to 0 or 2 modulo 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, as:

{ 1 3 k ( k − 2 ) when k ≡ 3 , 5 ( mod 6 ) ; 1 3 ( k + 1 ) ( k − 3 ) when k ≡ 0 , 2 ( mod 6 ) ; 1 3 ( k 2 − 2 k − 2 ) when k ≡ 1 , 4 ( mod 6 ) . {\displaystyle {\begin{cases}{\frac {1}{3}}k(k-2)&{\text{when }}k\equiv 3,5{\pmod {6}};\\{\frac {1}{3}}(k+1)(k-3)&{\text{when }}k\equiv 0,2{\pmod {6}};\\{\frac {1}{3}}(k^{2}-2k-2)&{\text{when }}k\equiv 1,4{\pmod {6}}.\end{cases}}}

Solutions yielding this number of triangles are known when k {\displaystyle k} is 3, 4, 5, 6, 7, 8, 9, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31 or 33. For k = 10, 11 and 12, the best solutions known reach a number of triangles one less than this upper bound. Furthermore, the upper bound for even values k {\displaystyle k} can be improved: ⌊ k ( k − 7 / 3 ) / 3 ⌋ {\displaystyle \lfloor k(k-7/3)/3\rfloor } . This bound can be reached for 10, 12 and 16. The upper bound for k = 11 has long been thought not to be reachable, which was shown to be correct in 2025 by Pavlo Savchuk with the use of a SAT solver.

Known constructions The following bounds are known:

In the projective plane

The version of the problem in the projective plane allows more triangles. In this version, it is convenient to include the line at infinity as one of the given lines, after which the triangles appear in three forms:

… excerpt ends here. Continue reading the full article.

Illustrations

Kobon triangle problem: Kobon triangles generated with 3, 4 and 5 straight line segments.
Kobon triangles generated with 3, 4 and 5 straight line segments.
Kobon triangle problem: Five lines forming a pentagram, with one more horizontal line below them, form seven triangles: five in the pentagram, and two more formed by pairs of rays emanating from the corners of the pentagram. If the lower horizontal line is moved to the line at infinity of the projective plane, all five pairs of rays emanating from the pentagram would form triangles with it.
Five lines forming a pentagram, with one more horizontal line below them, form seven triangles: five in the pentagram, and two more formed by pairs of rays emanating from the corners of the pentagram. If the lower horizontal line is moved to the line at infinity of the projective plane, all five pairs of rays emanating from the pentagram would form triangles with it.
Kobon triangle problem illustration
Kobon triangle problem illustration
Kobon triangle problem illustration

Worked examples

Example 1 — a first encounter with Kobon triangle problem

Start with the simplest possible case. Write down what Kobon triangle problem claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Kobon triangle problem before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Kobon triangle problem ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Kobon triangle problem

In research
Kobon triangle problem appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Kobon triangle problem in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Kobon triangle problem is common in secondary-school and first-year university syllabi. It links to neighbouring topics Discrete geometry, Recreational mathematics, Triangles, so understanding it makes those chapters shorter.
In everyday life
Look for Kobon triangle problem outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Kobon triangle problem in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Kobon triangle problem means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Kobon triangle problem out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Kobon triangle problem in simple terms?

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.

Why does Kobon triangle problem matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Kobon triangle problem?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Kobon triangle problem.

Tags

  • Discrete geometry
  • Recreational mathematics
  • Triangles
  • Unsolved problems in geometry

Keep exploring