University of Cambridge > Talks.cam > Combinatorics Seminar > Elusive problems in extremal graph theory

Elusive problems in extremal graph theory

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

  • UserDaniel Kráľ (University of Warwick)
  • ClockThursday 01 June 2017, 14:30-15:30
  • HouseMR12.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity