Organizational meeting/ a graph-theoretic approach to designing hash functions
(abstract)
This will primarily be an organizational meeting of the discrete math seminar for the year, and also give us the opportunity to meet the new graduate students interested in discrete math. Following this, we will introduce cyptographic hash functions and a graph-theoretic design strategy for these functions.
Jan 13: Stephen Hartke, Fisher's proof for tournaments of Seymour's 2nd neighborhood conjecture (abstract)