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

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

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

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.

Other lists

Type the title of a new list here Cold atoms analysis

Other talks

From 2nd to 3rd generation GW detectors RSC S F Boys-A Rahman Award Lecture Route to Hyperspectral Terahertz Microscopy via Nonlinear Ghost-Imaging Fenchel Duality Theory and a Primal-Dual Algorithm on Riemannian Manifolds Effective Hamiltonians and non-equilibrium dynamics in Floquet conformal field theories Hydrodynamics and Chaos in Quantum Matter
 

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