**Date** |
**Description** |

9/30 |
Lecture 1 : Graphs, Eulerian and Hamiltonian graphs, Trees and Prufer sequences. |

2/10 |
Lecture 2: Trees. |

7/10 |
Lecture 3: Coloring and Ramsey Theory. (See L. Lovasz, Three Short Proofs in Graph Theory for an alternative proof to Brook's theorem on coloring graphs, also J. Bondy, Short Proofs of Classical Theorems ). |

9/10 |
Lecture 4: Continuation of Ramsey Theory |

14/10 |
Lecture 5: Turans Theorem. (See M. Aigner, Turan's Graph Theorem.) |

16/10 |
Lecture 6: Hall's theorem, Konigs theorem and Matchings. |

21/10 |
Lecture 7: Posets, Dilworth's theorem. |

23/10 |
Lecture 8: More on flows in networks. |

28/10 |
Lecture 9: Graph Homology (Some brief notes). |

30/10 |
Lecture 10: Inclusion Exclusion |

4/11 |
Lecture 11: Stirling Numbers. |

6/11 |
Lecture 12: Generating functions. |

11/11 |
Lecture 13: Catalan numbers. |

13/11 |
Lecture 14: Combinatorial structures. |

18/11 |
Lecture 15: Partitions and q-numbers. |

20/11 |
Lecture 16: Latin Squares. |

25/11 |
Lecture 17: Latin Squares. (see excerpt from Latin squares: New Developments in the Theory andApplications by J. Denes and A.D. Keedwell.) |

27/11 |
Note: Thanksgiving, no lecture. |

2/12 |
Lecture 18: Codes and Design. |

4/12 |
Lecture 19: Lattices and Mobius Inversion. |