Danae Rupp, Rutgers University

Abstract

Ultraproducts are a very important tool in model theory, and are one of the most common model theoretic tools for proving non-model theory results. In this talk I will prove via ultraproducts that if every finite subgraph of a graph is k-colorable, then the whole graph must also be k-colorable.