- 2020-01-21 – Ander Lamaison (Freie Universität Berlin)- Ander’s favourite problems
- 2020-01-28 – Yifan Jing (UIUC) – The largest (k,l)-sum-free subsets by Jing
- 2020-02-04 – William Linz (UIUC) – Non-trivial d-wise intersecting families by O’Neil and Verstraete
- 2020-02-11 – Patrick Bennett (Western Michigan University) – Introduction to the Differential Equation method
- 2020-02-18 – Michelle Delcourt (Ryerson)- The Glauber dynamics for edges colorings of trees by Delcourt, Heinrich, and Perarnau
- 2020-02-25 – Souktik Roy (UIUC) – The typical structure of sets with small sumset by Campos, Collares, Morris, Morrison, and Souza
- 2020-03-03 – Sean English (UIUC) – Pushing the upper bound on the cop number of connected graphs
- 2020-03-10 – Bob Krueger (UIUC) – Repeated Patterns in proper colorings by Conlon and Tyomkyn
- 2020-03-17 – Spring Break
- 2020-03-24 – Cancelled due to COVID19
- 2020-03-31 – We recommend: Rob Morris (IMPA) – Erdos covering system – (Oxford Discrete Math and Prob. Seminar)
- 2020-04-07 – We recommend: Maria Chudnovsky (Princeton University) – Recent progress on the Erdos-Hajnal conjecture – (Virtual Combinatorics Coll)
- 2020-04-14 – Grace McCourt (UIUC) – Rational exponents in extremal graph theory by Bukh and Conlon
- 2020-04-21 – Oliver Gebhard (Goethe Universität Frankfurt) – Optimal group testing
- 2020-04-28 – Igor Araujo (UIUC) – An upper bound on the Erdős-Rogers function by Gowers and Janzer
- 2020-05-05 – Ramon Alvarez (UIUC) – The number of maximal independent sets in the hamming cube by Kahn and Park
- 2020-05-12 – Sam Spiro (UCSD) – Triangle-Free Subgraphs of Hypergraphs by Nie, Spiro, and Verstraëte
