Details of MA3103 (Autumn 2021)

Level: 3 Type: Theory Credits: 4.0

Course CodeCourse NameInstructor(s)
MA3103 Introduction to Graph Theory and Combinatorics Anirban Banerjee

Syllabus


  • Graph Theory: Fundamental concepts and basic definitions, path, cycles and trees, graph isomorphism, Eulerian and Hamiltonian graphs, planarity, connectivity, graph colourings, Euler's formula for planar graphs and proof of $5$ color theorem, matching, spectral graph theory; Numbered trees and Prufer code (if time permits).

  • \bCombinatorics: Inclusion-exclusion principle, pigeon hole principle; Sperner's theorem, Hall marriage theorem; Mantel's theorem, Turan's theorem; graphic sequences (if time permits).


Prerequisite
Linear Algebra I (MA2102)

References

  1. Bollobas, B., Modern Graph Theory, Springer-Verlag.

  2. Godsil, C. and Royle, G., Algebraic Graph Theory, Springer-Verlag.

  3. West, D., Introduction to Graph Theory, Prentice-Hall.


Course Credit Options

Sl. No.ProgrammeSemester NoCourse Choice
1 IP 1 Core
2 IP 3 Not Allowed
3 IP 5 Not Allowed
4 MR 1 Not Allowed
5 MR 3 Not Allowed
6 MS 3 Not Allowed
7 MS 5 Core
8 MS 7 Elective
9 MS 9 Elective
10 RS 1 Elective
11 RS 2 Elective