Seminars & Colloquia Calendar
Proof Methods in Combinatorics
Keith Frankston, Rutgers University
Date & time: Wednesday, 31 January 2018 at 12:10PM - 1:10PM
Abstract: The container theorem allows us to analyze the independent sets of a hypergraph by collecting each independent set in a small number of containers. This technique has led to many breakthroughs in combinatorics and number theory. Unfortunately, we won't be talking about it today. Instead I'll be presenting proofs of a couple of results each of which display an interesting proof technique.