Time:  3:30pm  4:30 pm 
Room: 
Wean Hall 8220

Speaker: 
James Cummings Department of Mathematical Sciences CMU 
Title: 
Universal graphs

Abstract: 
The wellknown "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. 