We haven't resolved whether it's possible to prove the exact largest possible size of certain mathematical structures without relying on exhaustive computer search.
open
Global / Unspecified, Global
WS01299
Some extremal problems in combinatorics have only been resolved through massive computational brute force, without a more elegant general proof explaining why the answer must be exactly what it is. This unresolved gap raises questions about the nature of mathematical understanding itself.