Sam Spiro, Rutgers University

Abstract

The method of hypergraph containers is a general technique for estimating the number of independent sets in hypergraphs.  In this talk we focus our attention on how this method works in the context of graphs, with us briefly discussing extensions to hypergraphs as time permits. This talk will be based off of Chapter 14 of the online notes available here.

See: https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html