Final list of presentations

**Digraphs**

- Maximal m-free digraphs
- Longest paths in tournaments
- Algorithms for long paths and cycles in digraphs
- Mod-q cycles via Lovasz's Local Lemma
- Minimum Cost Branchings and Matroid Intersection
- Tutte's Matrix-Tree theorem

**Random structures**

- "Realistic" probabilistic analysis of sorting algorithms (March 23)
- Superboolean rank and the largest triangular submatrix of a random matrix (April 27)