Ma121c Combinatorial Analysis
Spring 2006: March 27 - June 2
Venue: 151 Sloan
Meeting time: 3-4pm Mon, Tues, Thurs.

Instructor: Cheng Yeaw Ku
Office: 374 Sloan
Phone: (626) 395-4328
E-mail: cyk@caltech.edu
Office hour: see my timetable
Webpage: http://www.its.caltech.edu/~cyk

Course description:

This is an advanced undergraduate/beginning graduate course in Combinatorics. In this term we shall concentrate on graph theory. Topics include Matching, Connectivity, Planarity, Coloring, Network flows, Extremal graph theory etc.

Homework/Grading:

There will be no exams and grading will be based on homeworks only. You may discuss homework with other students but solutions should be written up individually. Late homework will not be accepted without legitimate explanation. Please turn in your homework to Ma121 box outside 253 Sloan. There will be about 5 homeworks altogether.

Textbooks:

  • Graph Theory. Reinhard Diestel. ISBN:0-387-98211-6.
  • Electronic Edition

    Homework:

  • Homework 1 due Thursday 13 April 2006, 4pm: [pdf]
  • Homework 2 due Thursday 27 April 2006, 4pm: [pdf]
  • Homework 3 due Thursday 11 May 2006, 4pm: [pdf]
  • Homework 4 due Friday 02 June 2006, 4pm: [pdf]