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 Charles Kenney at
Generously sponsored by DIMACS.
Click here for information about the seminar and the archive.
| Date: | March 2, 2022 |
|---|---|
| Speaker: | Brian Pinsky |
| Time: | 12:15PM |
| Place: | Graduate Lounge (7th floor of Hill Center) and Zoom |
| Title: | Combinatorics so easy my undergrads can do it |
| 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. |
| Date: | February 16, 2022 |
|---|---|
| Speaker: | Quentin Dubroff |
| Time: | 12:15PM |
| Place: | Graduate Lounge (7th floor of Hill Center) and Zoom |
| Title: | TBA |
| Abstract: | TBA |