NEWS

Our midterm is scheduled for Wednesday Feb 28, after the break.

Our Final exam is scheduled for Saturday, April 21 at 8:30 am in BUCH B215 . Early. It is a 3 hour exam.

This is an Honours course that has substantial use of proofs. The subject of Graph Theory can often be conveyed through pictures and students (and myself) find this makes the subject more appealing.

I will devote about 1/3 of the class time to student presentations of solutions to problems. My intention is to give you a sheet for the problems we are looking at and ask you to indicate whether you are ready to present, somewhat ready or not ready. Then I will select some presenters from those who say they are ready. Some portion of your grade comes from the sheet and some from the presentation. The presentation in the best case will be complete and clear and well delivered. Grading will be caring. I will endeavour that everyone presents at least 2 problems by the end of the course.

Various texts would be useful. The book by Reinhard Diestel is an excellent overview at a slightly higher level than some. The UBC library gives you access to this Springer text in electronic form. Also Diestel website

The text by Doug West is readily accessible. Any notes I type may look authoritative when typed so be wary. They may look perfect but may still contain errors! I don't have an editor.

I arrive most days by 9:00 or so. I will be teaching MATH 340 from 12-1 MWF. I typically do not read my email from home (i.e. evenings and weekends).

There is lots of information on Wikipedia about some of the big advances in Graph Theory. I should have pointers to them. The Robertson-Seymour Graph Minors project is a huge enterprise that eventually brought in Robin Thomas and Maria Chudnovsky. Robertson Seymour Theorem

The perfect graph conjecture was made by Claude Berge in 1963 and was finally proved in 2006 by Chudnovsky, Robertson, Seymour and Thomas. Strong Perfect Graph Theorem

We proved in class that if the minimum degree of G is at least n/2, then G has a Hamilton cycle. Christofides, Kuhn and Osthus (2012) proved that if the minimum degree is (1/2+epsilon)n, then one can find n/8 edge disjoint Hamilton cycles where n/8 is essentially best possible.

Graphs appear in many applications. Often unexpectedly. Some notes on the problem of squared rectangles. The interesting outcome of this is searching for squared rectangles of n squares con be done by generating all (planar) graphs with n edges.