University of Cambridge > Talks.cam > DPMMS Lists > The structure of large graphs

The structure of large graphs

Add to your list(s) Download to your calendar using vCal

  • UserNoga Alon (Tel Aviv)
  • ClockFriday 13 February 2009, 17:00-18:00
  • HouseMR2.

If you have a question about this talk, please contact Helen Innes.

A property of graphs is hereditary if it is closed under deleting vertices. Most interesting properties of graphs are hereditary, and their study reveals some unexpected phenomena. This study combines combinatorial, probabilistic, geometric and analytic tools, including Szemeredi’s Regularity Lemma and Grothendieck’s Inequality, and leads to interesting extremal and algorithmic applications.

I will survey the topic, mentioning the main questions, describing several recent results and giving a brief description of the relevant proof techniques.

This talk is part of the DPMMS Lists series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2022 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity