2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2025
Finding Large Sets Without Arithmetic Progressions of Length Three: An Empirical View and Survey II
William Gasarch, James Glenn, Clyde Kruskal
There has been much work on the following question: given n how large can a subset of {1,...,n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most o…
math.CO2023
On SAT Solvers and Ramsey-type Numbers
Burcu Canakci, Hannah Christenson, Robert Fleischman +3
We created and parallelized two SAT solvers to find new bounds on some Ramsey-type numbers. For , let be the least such that for all -colorings of the $[n]\t…
cs.CC2012★ 2 cited
An NP-Complete Problem in Grid Coloring
Daniel Apon, William Gasarch, Kevin Lawler
A c-coloring of G(n,m)=n x m is a mapping of G(n,m) into {1,...,c} such that no four corners forming a rectangle have the same color. In 2009 a challenge was proposed via the inter…