4 citations · 22 across the 26 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.HO2014
How many ways can you make change: Some easy proofs
William Gasarch
Given a dollar, how many ways are there to make change using pennies, nickels, dimes, and quarters? What if you are given a different amount of money? What if you use different coi…
cs.CC2014
A Sane Proof that COLk \le COL3
William Gasarch
Let COLk be the set of all k-colorable graphs. It is easy to show that if a<b then COLa \le COLb (poly time reduction). Using the Cook-Levin theorem it is easy to show that if 3 \l…
math.CO2014
Distinct volume subsets
David Conlon, Jacob Fox, William Gasarch +3
Suppose that and are positive integers with . Let be the largest integer such that any set of points in contains a subset of $…