Wednesday, May 5, 2021
05/05/2021 - 4:15pm
I will give a broad overview of some classical and recent inequalities for the numbers of various graphs, partitions, independent sets of matroids, etc. We will ask which of them have a combinatorial proof and what does that even mean? This turns out to be a difficult largely unresolved problem which we also discuss. The talk is aimed at a general audience.