University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Computability and Finite Forcibility of Graph Limits

Computability and Finite Forcibility of Graph Limits

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

  • UserJake Cooper (University of Warwick)
  • ClockThursday 27 October 2016, 15:00-16:00
  • HouseLTA Watson.

If you have a question about this talk, please contact Guillem Perarnau.

Abstract not available

This talk is part of the Combinatorics and Probability seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.