25 May 2004

Dear Friends and Colleagues,

I'm delighted to inform you that Neil Robertson has been awarded the 2004 George Polya Prize of the Society for Industrial and Applied Mathematics (SIAM). He shares the prize with his long time collaborator Paul Seymour of Princeton University for their "magnificent proof of the Wagner Conjecture in the theory of graph minors."

The George Polya Prize, established in 1969, is awarded this year for a notable application of combinatorial theory. Each recipient of the Polya Prize receives an engraved medal and shares a cash award of $20,000. The award will be presented at the 2004 SIAM Annual Meeting scheduled for July 12-16, 2004, at the Oregon Convention Center, Portland, Oregon. (For more on the Polya Prize see http://www.siam.org/prizes/polya.htm)

Please join me in congratulating Neil on this wonderful recognition of his and Paul's work.

Best,
Peter

Department of Mathematics