James Cummings: Universal graphs

Mathematical logic seminar – Jan 24 2017
Time:     3:30pm – 4:30 pm

Room:     Wean Hall 8220

Speaker:         James Cummings
Department of Mathematical Sciences
CMU

Title:     Universal graphs

Abstract:

The well-known “random countable graph” or “Rado graph” is a countable graph which contains induced copies of every countable graph. We discuss the existence of such objects in uncountable cardinalities.

Leave a Reply

Your email address will not be published. Required fields are marked *

Time limit is exhausted. Please reload CAPTCHA.