A SAT-plus-LLM method discovers infinite families of doubly saturated Ramsey-good graphs, answering Grinstead and Roberts' 1982 question.
In: Gurfinkel, A., Ganesh, V
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Augmenting SAT solvers with the Euler-Parker algorithm solves hard 10x10 orthogonal Latin square problems in a median of 5100 seconds instead of failing after seven days.
citing papers explorer
-
Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery
A SAT-plus-LLM method discovers infinite families of doubly saturated Ramsey-good graphs, answering Grinstead and Roberts' 1982 question.
-
Improving SAT Solvers on Orthogonal Latin Square Problems
Augmenting SAT solvers with the Euler-Parker algorithm solves hard 10x10 orthogonal Latin square problems in a median of 5100 seconds instead of failing after seven days.