Elusive problems in extremal graph theory

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

• Daniel Kráľ (University of Warwick)
• Thursday 01 June 2017, 14:30-15:30
• MR12.

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:

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

Note that ex-directory lists are not shown.