Phillip Wesolek : A discussion of the Henson Graph

Posted by , part of the Logic Seminar.

At

Aug. 30, 2011, 4 p.m.

In

SEO 1227

Abstract

This talk will outline the problem motivating Freer, Patel, and Ackerman's work on concentrated measures. We will first formally construct a measure concentrated on the isomorphism class of the random graph. Second, we will show this approach fails for the Henson graph.