Calendar
The undecidability of joint embedding for hereditary graph classes, and related problems
Sam Braunfeld (Rutgers)
Location: Hill 705
Date & time: Monday, 12 February 2018 at 5:00PM - 6:00PM
Abstract: We will sketch a proof of the undecidability of joint embedding for finitely-constrained hereditary graph classes. Time permitting, we will discuss the analogous question in other classes of structures, such as 3-dimensional permutations.
