New computational constructions claim to achieve the upper bounds for 23 and 27 lines in the Kobon triangle problem, yielding N(23)=161 and N(27)=225, subject to the reliability of a heuristic straightening step.
On simple arrangements of lines and pseudo-lines in P2 and R2 with the maximum number of triangles
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening
New computational constructions claim to achieve the upper bounds for 23 and 27 lines in the Kobon triangle problem, yielding N(23)=161 and N(27)=225, subject to the reliability of a heuristic straightening step.