Brian Pinsky, Rutgers University

Abstract

In this well prepared talk about material specifically chosen for a GCS audience, I will cover results that I could (hypothetically) have covered with my 461 students. These include various applications of Konig's lemma/compactness (tools for generalizing finite results to infinite ones). I'll even define a couple things you may not have heard of, like unfriendly graph colorings and the paris harrington theorem.