Course Notes:

Class01: Graph Theory - Basic definitions

Class02: Graph Theory - Eulerian Graphs

Class03: Graph Theory - Trees

Class04: Graph Theory - Number of trees

Class05: Graph Theory - Graph Colouring, Brook's Theorem

Class06: Graph Theory: Ramsey's Theorem 1

Class07: Graph Theory: Ramsey's Theorem 2

Class08: Graph Theory: Ramsey's Theorem 3

Class09: Graph Theory - Turan's Theorem

Class10: Application of Turan's Theorem to parallel computation

Class11: Graph Theory - Hall's Theorem

Class12: Graph Theory - SDR's and Konigs theorem

Class13: Dilworth's theorem 1

Class14: Dilworth's theorem 2

Class15: Extremal Set Theory - Sperner and Erdos,Ko,rado

Class16: Inclusion-Exlusion 1

Class17: Inclusion-Exlusion 2

Class18: Polya counting 1

Class19: Polya counting 2

Class20: Polya counting 3

Class21: Polya counting 4

Class22: Polya counting 5

Class23: Probabilistic Method 1

Class24: Probabilistic Method 2

Class25: Random Graphs 1 - Diameter, Connectivity

Class26: Random Graphs 2 - Connectivity

Class27: Random Graphs 3 - Chromatic number and girth

Class28: Combinatorial Games - Basic Definitions

Class29: Combinatorial Games - Sprague-Grundy numbers 1

Class30: Combinatorial Games - Sprague-Grundy numbers 2

Class31: Combinatorial Games - Subtraction games

Class32: Combinatorial Games - Geography

Class33: Combinatorial Games - Maker-Breaker games




Some notes on Polya theory

Some more notes on Polya theory by Tom Davis

Some notes on Combinatorial Games by Tom Ferguson

Old tests from Discrete Mathematics course

Old tests from Graph Theory course