|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Elusive problems in extremal graph theory
If you have a question about this talk, please contact Andrew Thomason.
Empirical experience suggests that optimal solutions to extremal graph theory problems can be made asymptotically unique by introducing additional constraints. Lovász conjectured that this phenomenon is true in general in the following sense: every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints such that the resulting set is satisfied by an asymptotically unique graph. We will present a counterexample to this conjecture and discuss related results.
The talk is based on joint work with Andrzej Grzesik and László Miklós Lovász.
This talk is part of the Combinatorics Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsCambridge Biomedical Research Centre "Distinguished Visitors" 2017 Lecture Series TCM Blackboard Series Mind-matter Unification Project (TCM Group, Cavendish Laboratory)
Other talksExploring the Universe with Gravitational Waves: LIGO and Beyond LARMOR LECTURE - title to be confirmed Controlling the Climate: can we refreeze the Arctic? Quentin Skinner Lecture & Colloquium: Dr Sophie Smith (Oxford): 'The Nature of Politics and the History of Political Thought' Title: Time to think again… Railway induced ground vibrations: hybrid predictions combining experimental measurements and numerical models