skip to main content
Caltech
Fires burning in Greater Los Angeles area have had significant impact on the Caltech's community and surrounding areas. For information and resources for members of the Caltech community, go to https://www.caltech.edu/fire.

Logic Seminar

Wednesday, May 28, 2014
2:00pm to 3:30pm
Add to Cal
A model-theoretic portrait of a family of countably universal graphs
Rehana Patel, Assistant Professor, Mathematics, Olin College of Engineering,

Abstract: Henson's family of countable homogeneous-universal $K_n$-free graphs, $n\ge 3$, has been widely studied in model theory.  Less well studied are the existentially complete, countable universal $B_{n,3}$--free graphs, where $B_{n,3}$ is the graph on $n+2$ vertices consisting of a $K_n$ and a triangle joined at one vertex.  These graphs were shown to exist by Komjath (for $n=3$, the `bowtie') and by Cherlin, Shelah and Shi (for $n \ge 4$).  In this talk I will describe the structure of these graphs, and present some new and old results, due to myself and others, about their model-theoretic properties.

For more information, please contact Alekos Kechris by email at mathinfo@caltech.edu.