Discrete Mathematics-Period 2

This course is about two (related) subjects, namely Graph Theory and Combinatorics.A graph consists of points (or vertices) and lines (or edges) connecting pairs of points. Graphs occur as mathematical models for many situations in both pure and applied mathematics. Combinatorics involves formulas and techniques for enumeration.
We treat the following topics.
- Elementary graph concepts
- Trees, spanning trees
- Eulerian and Hamiltonian trails/circuits
- Planarity
- Matchings, flows
- Binomial coefficients and generalisations
- Pigeonhole and inclusion-exclusion principles
- Generating functions
- Recurrence relations
- Permutation groups

Contact hours listed under a course description may vary due to the combination of lecture-based and independent work required for each course therefore, CEA's recommended credits are based on the ECTS credits assigned by VU Amsterdam. 1 ECTS equals 28 contact hours assigned by VU Amsterdam.