BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Universal graphs - Mykhaylo Tyomkin
DTSTART:20080227T140000Z
DTEND:20080227T150000Z
UID:TALK10956@talks.cam.ac.uk
CONTACT:Anton Evseev
DESCRIPTION:A countable graph G is called "universal" for a property P if 
 G contains\nany countable graph H in P as a subgraph. The most remarkable 
 example of a\nuniversal graph is the Rado graph\, also known as the "infin
 ite random\ngraph". In general the universal graph need not always exist\,
  so the\nnatural question to ask is\, for which properties one can find su
 ch a graph.\nI'm going to discuss recent results\, which settle this quest
 ion for a\nproperty of not containing a given finite subtree.
LOCATION:MR4\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR