The structure of large graphs

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

• Noga Alon (Tel Aviv)
• Friday 13 February 2009, 17:00-18:00
• MR2.

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR2
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.