When

Start: 11/11/2009 - 4:15pm

End : 11/11/2009 - 5:15pm

End : 11/11/2009 - 5:15pm

Category

Colloquium

Speaker

Professor Benjamin Sudakov, UCLA

Abstract

In a typical extremal problem one wants to determine maximum cardinality of discrete structure with certain prescribed properties. Probably the earliest such result was obtained 100 years ago by Mantel who computed the maximum number of edges in a triangle free graph on n vertices. This was generalized by Turan for all complete graphs and became a starting point of Extremal Graph Theory. In this talk we

survey several classical problems and results in this area and present some interesting applications of Extremal Graph Theory to other areas of mathematics. We also describe a recent surprising generalization of Turan's theorem which was motivated by a question in Computational Complexity.

Where

Millikan Room 134, Pomona College

Misc. Information

Refreshments will be served served at 3:45 p.m. in the Harry Mullikin Room, Millikan 209

**************************************************

The dinner will be hosted by Prof. Lenny Fukshansky. If interested in attending, call ext. 70014

__Claremont Graduate University__ | __Claremont McKenna__ | __Harvey Mudd__ | __Pitzer__ | __Pomona__ | __Scripps__

Proudly Serving Math Community at the Claremont Colleges Since 2007

Copyright © 2018 Claremont Center for the Mathematical Sciences