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

Speaker: Ander Lamaison (Free University, Berlin)

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

Title: Ramsey upper density of infinite graphs

Let H be an infinite graph. In a two-coloring of the edges of the complete 
graph on the natural numbers, what is the densest monochromatic subgraph 
isomorphic to H that we are guaranteed to find? We measure the density of 
a subgraph by the upper density of its vertex set. This question, in the 
particular case of the infinite path, was introduced by Erdos and Galvin. 
Following a recent result for the infinite path, we present bounds on the 
maximum density for other choices of H, including exact values for a 
wide class of bipartite graphs.

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

Next week: Pawel Rzazewski

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