When the smallest is greatest

Abstract: 

At the intersection of graph theory, extremal set theory and optimisation theory lies a collection of mathematical results often known as ‘min-max theorems’ and include celebrated combinatorial results such as Hall’s Theorem and Dilworth’s Theorem. These results are not only beautiful and fascinating but also have great theoretical and practical value. This talk will present some of these theorems along with their applications.