The largest set of points in the plane with no empty convex hexagon and no convex heptagon has size 23, proved by a SAT-modulo-realizability solver that finds thousands of witnessing configurations.
Title resolution pending
1 Pith paper cite this work, alongside 38 external citations. Polarity classification is still indexing.
1
Pith paper citing it
38
external citations · OpenAlex
fields
cs.CG 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Toward Satisfiability Modulo Realizability
The largest set of points in the plane with no empty convex hexagon and no convex heptagon has size 23, proved by a SAT-modulo-realizability solver that finds thousands of witnessing configurations.