Table of contents
Multi
Module Info
Module Link/Module Webpage/Lecture Notes
Professor: Rob Silversmith
Term: 1
Status: Core
Assessment: 90% exam, 10% AssignmentsRating (Personal Opinion)
Difficulty: ★★☆☆☆
Professor: ★★★★★
Teaching Style: ★★★★☆
Would take again? Yes
| Topic | Rating | Summary |
|---|---|---|
| Enumerative Combinatorics | ★★★★★ | Basic counting (Lists with and without repetitions, Binomial coefficients and the Binomial Theorem) Applications of the Binomial Theorem (Multinomial Theorem, Multiset formula, Principle of inclusion/exclusion) Linear recurrence relations and the Fibonacci numbers Generating functions and the Catalan numbers Permutations, Partitions and the Stirling and Bell numbers |
| Graph Theory | ★★★★☆ | Basic concepts (isomorphism, connectivity, Euler circuits) Trees (basic properties of trees, spanning trees, counting trees) Planarity (Euler’s formula, Kuratowski’s theorem, the Four Colour Problem) Matching Theory (Hall’s Theorem and Systems of Distinct Representatives) Elements of Ramsey Theory |
- Edward E. Bender and S. Gill Williamson, Foundations of Combinatorics with Applications, Dover Publications, 2006.
- John M. Harris, Jeffry L. Hirst and Michael J. Mossinghoff, Combinatorics and Graph Theory, Springer-Verlag, 2000.