Using SAT Solvers to Investigate Ramsey-Type Numbers

October 19, 2016
2:00 pm - 5:30 pm
Hall C

Track: General
Type: Posters
Level: All

We formulated the definition of a Ramsey-type numbers as a boolean satisfiability problem. Then we modified existing satisfiability solver algorithms based on the characteristics of the formula, which allowed us to find a new lower bounds for this number.


, Student, University of Maryland