Mar 6 : Restricted partitions.
Mar 8 : Graphs and their representation.
Isomorphism of graphs. Valency.
Tutorial: Chapters 25 and 26.
Mar 13 : Paths and cycles. Trees.
Mar 15 : Vertex colouring.
Planar graphs; examples.
Tutorial: Chapter 15 and review for test #2.
Mar 20 : Euler's theorem. Degree of a region.
Necessary conditions for planarity. Kuratowski theorem.
Mar 22 : Kuratowski theorem. Petersen graph
example. Words, codes and errors.
Tutorial: Test #2 (Chapters 25, 26 and 15).
Mar 27 : Distance, minimum distance and correcting errors.
Mar 29 : Linear codes and their construction.
Tutorial: Chapters 15 and 24, and solutions of test #2.
Apr 3 : Designs. Examples. Necessary and
sufficient condition.
Apr 5 : Necessary and sufficient condition (cont).
Course overview.
Tutorial: Chapter 24 and 11.
To February lectures.