This seminar gives graduate students the opportunity to hear and present talks on discrete mathematics, either on topics beyond a standard combinatorics class or on original research. GCS is meant to be a friendly, slightly informal speaking environment where questions are encouraged at all points throughout the talk. We only assume a basic general knowledge of combinatorics (at most, basic combinatorics one might learn in a single semester introductory course), so students in any area are welcome to attend.
Speakers for the GCS are welcome (from the math department, other departments, and elsewhere). Please email Corrine Yap at
Generously sponsored by DIMACS.
Click here for information about the seminar and the archive.
|Date:||May 1st, 2019|
|Place:||Graduate Student Lounge, 7th Floor, Hill Center|
|Title:||Independent Sets in the Hypercube|
|Abstract:||I will explain an old result of Sapozhenko that counts the number of independent sets in a cube graph. The reference I will be using is this recent exposition.|