Modules / Lectures

Name | Download | Download Size |
---|---|---|

Lecture Note | Download as zip file | 1.7M |

Module Name | Download | Description | Download Size |
---|---|---|---|

Covering problems | Lecture1 | Handouts | 190 |

Covering problems | Lecture2 | Handouts | 214 |

Covering problems | Lecture3 | Handouts | 166 |

Covering problems | Lecture4 | Handouts | 234 |

Covering problems | Lecture5 | Handouts | 278 |

Covering problems | Lecture6 | Handouts | 227 |

Covering problems | Lecture7 | Handouts | 262 |

Covering problems | Lecture8 | Handouts | 258 |

Connectivity | Lecture9 | Handouts | 287 |

Connectivity | Lecture10 | Handouts | 249 |

Connectivity | Lecture11 | Handouts | 216 |

Connectivity | Lecture12 | Handouts | 199 |

Coloring | Lecture13 | Handouts | 222 |

Coloring | Lecture14 | Handouts | 164 |

Coloring | Lecture15 | Handouts | 213 |

Coloring | Lecture16 | Handouts | 211 |

Coloring | Lecture17 | Handouts | 198 |

Coloring | Lecture18 | Handouts | 173 |

Coloring | Lecture19 | Handouts | 137 |

Coloring | Lecture20 | Handouts | 91 |

Coloring | Lecture21 | Handouts | 115 |

Coloring | Lecture22 | Handouts | 137 |

Special classes of graphs | Lecture23 | Handouts | 187 |

Special classes of graphs | Lecture24 | Handouts | 197 |

Special classes of graphs | Lecture25 | Handouts | 172 |

Special classes of graphs | Lecture26 | Handouts | 200 |

Special classes of graphs | Lecture27 | Handouts | 248 |

Special classes of graphs | Lecture28 | Handouts | 233 |

Special classes of graphs | Lecture29 | Handouts | 214 |

Special classes of graphs | Lecture30 | Handouts | 175 |

Network flows | Lecture31 | Handouts | 191 |

Network flows | Lecture32 | Handouts | 167 |

Network flows | Lecture33 | Handouts | 141 |

Network flows | Lecture34 | Handouts | 151 |

Random graphs and probabilistic method | Lecture35 | Handouts | 145 |

Random graphs and probabilistic method | Lecture36 | Handouts | 148 |

Random graphs and probabilistic method | Lecture37 | Handouts | 118 |

Random graphs and probabilistic method | Lecture38 | Handouts | 122 |

Graph minors | Lecture39 | Handouts | 208 |

Graph minors | Lecture40 | Handouts | 166 |

Sl.No | Chapter Name | English |
---|---|---|

1 | Introduction: Vertex cover and independent set | PDF unavailable |

2 | Matchings: Konigs theorem and Halls theorem | PDF unavailable |

3 | More on Halls theorem and some applications | PDF unavailable |

4 | Tuttes theorem on existence of a perfect matching | PDF unavailable |

5 | More on Tuttes theorem | PDF unavailable |

6 | More on Matchings | PDF unavailable |

7 | Dominating set, path cover | PDF unavailable |

8 | Gallai : Millgram theorem, Dilworths theorem | PDF unavailable |

9 | Connectivity: 2-connected and 3- connected graphs | PDF unavailable |

10 | Mengers theorem | PDF unavailable |

11 | More on connectivity: k- linkedness | PDF unavailable |

12 | Minors, topological minors and more on k- linkedness | PDF unavailable |

13 | Vertex coloring: Brooks theorem | PDF unavailable |

14 | More on vertex coloring | PDF unavailable |

15 | Edge coloring: Vizings theorem | PDF unavailable |

16 | Proof of Vizings theorem, Introduction to planarity | PDF unavailable |

17 | 5- coloring planar graphs, Kuratowskys theorem | PDF unavailable |

18 | Proof of Kuratowskys theorem, List coloring | PDF unavailable |

19 | List chromatic index | PDF unavailable |

20 | Adjacency polynomial of a graph and combinatorial Nullstellensatz | PDF unavailable |

21 | Chromatic polynomial, k - critical graphs | PDF unavailable |

22 | Gallai-Roy theorem, Acyclic coloring, Hadwigers conjecture | PDF unavailable |

23 | Perfect graphs: Examples | PDF unavailable |

24 | Interval graphs, chordal graphs | PDF unavailable |

25 | Proof of weak perfect graph theorem (WPGT) | PDF unavailable |

26 | Second proof of WPGT, Some non-perfect graph classes | PDF unavailable |

27 | More special classes of graphs | PDF unavailable |

28 | Boxicity,Sphericity, Hamiltonian circuits | PDF unavailable |

29 | More on Hamiltonicity: Chvatals theorem | PDF unavailable |

30 | Chvatals theorem, toughness, Hamiltonicity and 4-color conjecture | PDF unavailable |

31 | Network flows: Max flow mincut theorem | PDF unavailable |

32 | More on network flows: Circulations | PDF unavailable |

33 | Circulations and tensions | PDF unavailable |

34 | More on circulations and tensions, flow number and Tuttes flow conjectures | PDF unavailable |

35 | Random graphs and probabilistic method: Preliminaries | PDF unavailable |

36 | Probabilistic method: Markovs inequality, Ramsey number | PDF unavailable |

37 | Probabilistic method: Graphs of high girth and high chromatic number | PDF unavailable |

38 | Probabilistic method: Second moment method, Lovasz local lemma | PDF unavailable |

39 | Graph minors and Hadwigers conjecture | PDF unavailable |

40 | More on graph minors, tree decompositions | PDF unavailable |

Sl.No | Language | Book link |
---|---|---|

1 | English | Not Available |

2 | Bengali | Not Available |

3 | Gujarati | Not Available |

4 | Hindi | Not Available |

5 | Kannada | Not Available |

6 | Malayalam | Not Available |

7 | Marathi | Not Available |

8 | Tamil | Not Available |

9 | Telugu | Not Available |