***********************************
                * Princeton Discrete Math Seminar *
                ***********************************

Speaker: Liana Yepremyan (Emory U.)

Thursday 13th April, 3:00 in Fine Hall 224.

Title: Ramsey graphs and additive combinatorics without addition

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.

		----------------------------------

Anyone wishing to be added to or removed from the mailing list should
contact Paul Seymour (pds@math.princeton.edu)