BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Elusive problems in extremal graph theory - Daniel Kráľ (Univers
 ity of Warwick)
DTSTART:20170601T133000Z
DTEND:20170601T143000Z
UID:TALK72150@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:Empirical experience suggests that optimal solutions to extrem
 al graph theory problems can be made asymptotically unique by introducing 
 additional constraints. Lovász conjectured that this phenomenon is true i
 n general in the following sense: every finite feasible set of subgraph de
 nsity constraints can be extended further by a finite set of density const
 raints such that the resulting set is\nsatisfied by an asymptotically uniq
 ue graph. We will present a counterexample to this conjecture and discuss 
 related results.\n\nThe talk is based on joint work with Andrzej Grzesik a
 nd László Miklós Lovász.
LOCATION:MR12
END:VEVENT
END:VCALENDAR