BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Extremal graphs and graph limits - László Lóvász (Eötvös Lor
 ánd University)
DTSTART:20120525T133000Z
DTEND:20120525T143000Z
UID:TALK38032@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:Growing sequences of dense graphs have a limit object in terms
  of a symmetric measuable 2-variable function. A typical use of this fact 
 in graph theory is the following: we want to prove a result\, say an inequ
 ality between subgraph densities. We look at a sequence of\ncounterexample
 s\, and consider their limit. Often this allows clean formulations and arg
 uments that would be awkward or impossible in the finite setting. We illus
 trate this by some results on Sidorenko's conjecture and "common graphs".\
 n\nThis setting also allows us to pose and in some cases answer general qu
 estions about extremal graph theory: which inequalities between subgraph d
 ensities are valid\, and what is the possible structure of extremal graphs
 .\n
LOCATION:MR4
END:VEVENT
END:VCALENDAR