Ramsey graphs and additive combinatorics without addition

Liana Yepremyan, Emory University
Fine Hall 224

In-Person Talk 

A graph is Ramsey if its largest clique or independent set is of size logarithmic in the number of vertices. While almost all graphs are Ramsey, there is still no known explicit construction of Ramsey graphs.

We discuss recent progress on finding these "dark matter" of graphs. Along the way, we study some fundamental problems in additive combinatorics, and discover that group structure is superfluous for these problems. Joint work with David Conlon, Jacob Fox and Huy Tuan Pham.