Thursday, April 24, 2014 - 12:05
1 hour (actually 50 minutes)
Let G be an abelian group. A subset A of G is a Sidon set if A has the property that no sum of two elements of A is equal to another sum of two elements of A. These sets have a rich history in combinatorial number theory and frequently appear in the problem papers of Erdos. In this talk we will discuss some results in which Sidon sets were used to solve problems in extremal graph theory. This is joint work with Mike Tait and Jacques Verstraete.