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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Elusive problems in extremal graph theory

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lecture Room 2, Institute for Manufacturing, 17 Charles Babbage Drive, Cambridge CB3 0FS Murray Edwards College G06, Boulind room, Mary Allan Building, , Faculty of Education, Hills Road, Cambridge, CB2 8PQ

Other talks

Content, Caching and Kubernetes: Performance and User Experience in the Browser TBC Cooperation as a Laboratory of Being CSAR lecture: Climate Repair (TBC) Talk TBC Haematology and Palliative Care
 

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