Bounds for Greedy $B_h$-sets

Kevin O'Bryant

A set $A$ of nonnegative integers is called a $B_h$-set if every solution to $a_1+\cdots +a_h=b_1+\cdots +b_h$, where $a_i,b_i\in A$, has $\{a_1,\dots ,a_h\}=\{b_1,\dots ,b_h\}$ (as m…