MATH 350 - Graph theory and Combinatorics.  Fall 2013


Instructor:

Sergey Norin
 

Phone:

398-3819

Office:

Room 1116, Burnside Building

Office hours:

Tuesday, 2:00-4:00 PM and by appointment

Email:

sergey.norin [at] mcgill.ca

Web:

http://www.math.mcgill.ca/~snorin

Lecture:

Time:

Monday, Tuesday, Thursday,  4:35-5:25 PM.

Location:

Burnside 1B24

Topics:

The course will cover fundamental concepts in graph theory: trees, matchings, connectivity, graph
coloring, planar graphs.

Detailed Course outline

Notes from Fall 2012 (courtesy of Tommy Reddad)

(The contents and the numbering of the results in the notes differ slightly from the ones in the current course.
If you notice any misprints in the notes, please, notify the instructor.)

Practice Final


Practice Midterm

Assignments:

  1. Assignment 1 (due Thursday, October 3rd) Solutions
  2. Assignment 2 (due Monday, October 21st) Solutions
  3. Assignment 3 (due Thursday, November 7th) Solutions
  4. Assignment 4 (due Thursday, November 21st) Solutions
  5. Assignment 5 (due Tuesday, December 3rd) Solutions

Pre-requisites and restrictions:

The pre-requisites are Math235 or Math240 and Math 251 or Math 223.
Not open to students who have taken or are taking MATH 343 or MATH 340.

Textbooks:

References that you may find helpful are

  Graph Theory by R. Diestel,
  Introduction to Graph Theory by D. West.

Grading policy:

Course grades will be based upon assignments (20%), midterm (20%), and a final exam (60%) - or
assignments (20%) and final exam (80%) if this leads to a better mark.