Discrete Mathematics

Discrete Mathematics I (ECS201) Semester I, 2019-20 at IISER Bhopal

Course Contents:

1. Mathematical proofs, proofs by induction, by contradiction, proving the contrapositive.
2. Basic counting techniques, pigeon-hole principle, recurrence relations, generating functions, principle of inclusion and exclusion, Mobius inversion.
3. Graphs, trees - definitions. Connectivity, paths, cycles, Eulerian walks, Hamiltonian cycles, cliques, colourings, graph matching, planarity.
4. Some other topics from combinatorics and graph theory.

Books and References:

1. Discrete Mathematics and Its Applications by Kenneth H Rosen, Seventh Edition, McGraw Hill.
2. Basic Techniques of Combinatorial Theory by Daniel I.A. Cohen.
3. Introduction to Graph Theory, 2nd Edition by Douglas B West