If there is any feedback, please provide it anonymously in this Google form.
Please join this Google classroom for class related announcements.
See this for the question bank.
Marks distribution: 30% Internal Evaluation (Two quizzes (20%) plus class participation (10%)); 30% Mid-term; and 40% End-term.
Reference Sheet: Before the mid-term and end-term examinations, you may submit one handwritten, single-sided page of notes. This reference sheet will be provided to you during the examination. If I find that anyone is abusing this privilege, I may either enforce some uniformity requirements or withdraw this provision for the entire class.
| Date | References | |
|---|---|---|
| Lecture 01 | 4th Aug 2026 | Introduction and Euler Tour (Ch 1.1 and 1.8) |
| Lecture 02 | 5th Aug 2026 | Degrees (Ch 1.2) |
| Lecture 03 | 7th Aug 2026 | Bipartite Graphs and Trees (Ch 1.6 and Theorem 1.5.1) |
| Lecture 04 | 11th Aug 2026 | Bipartite Graphs and Trees (Ch 1.6 and Theorem 1.5.1) |
| Lecture 05 | 12th Aug 2026 | Matching in Bipartite Graphs (Ch 2.1) |
| Lecture 06 | 14th Aug 2026 | Konig's Theorem (Ch 2.1) |
| Lecture 07 | 18th Aug 2026 | Hall's Theorem (First and second proof) (Ch 2.1) |
| Lecture 08 | 19th Aug 2026 | Gale and Shapley's Theorem (Ch 2.1) |
| Lecture 09 | 21st Aug 2026 | Connectivity (Ch 1.4) |
| Nr. | Book | Authors |
|---|---|---|
| [1] | Graph Theory (Fifth Edition) | Reinhard Diestel |
All the chapters mentioned above are from [1]. You are encouraged to see the book A First Look at Graph Theory by John Clark, Derek Allan Holton for simpler examples.