DISCRETE STRUCTURES II
|
|
Schedule.
Week 1.
Tuesday January 10th. Stable Marriages.
Related Reading.
Some Slides on Stable Matchings by Kevin Wayne.
Thursday January 12th. Matchings; Augmenting Paths; Hall's Theorem.
Related Reading.
For notes on matchings in bipartite graphs, see Diestel's book (Section 2.1).
Friday January 13th. Tutorial: Review of basic graph concepts. (McConnell Room 103, 4pm-6pm)
Related Reading.
For basic definitions in graph theory, see Diestel's book (Chapter 1).
Week 2.
Tuesday January 17th. Applications of Hall's theorem: Latin Squares; Regular graphs; Systems of Distinct Representatives.
Related Reading.
For an alternative proof of the latin squares, see Biggs (Section 17.3).
For notes on SDRs, see Van Lint and Wilson (Chapter 5).
Thursday January 19th. Konig-Egervary Theorem, Vertex Cover and applications. [Assignment 1 assigned.]
Related Reading.
For notes on the Konig-Egervary Theorem, see Van Lint and Wilson (Chapter 5).
For an alternative proof of the vertex cover theorem, see see Diestel's book (Section 2.1).
Week 3.
Tuesday January 24th. Edge colouring: scheduling; Clos networks.
Related Reading.
For notes on edge colouring, see Biggs (Section 17.2) or Diestel's book (Section 5.3).
Some Slides on Clos networks by Nick McKeown.
Thursday January 26th. Matching Markets.
Related Reading.
Some notes on matching markets by D. Easley and J. Kleinberg.
Week 4.
Tuesday January 31st. Planar graphs: Euler's Formula; the Platonic solids. [Assignment 1 due.]
Related Reading.
For notes on planar graphs and the Platonic solids, see Matousek and Nesetril (Chapter 5, especially Sections 5.3).
Thursday February 2nd. The 5-colour theorem; the Art Gallery theorem. [Assignment 2 assigned.]
Related Reading.
For notes on colouring planar graphs, see Matousek and Nesetril (Section 5.4) or Diestel's book (Section 5.1).
For notes on the art gallery theorem, see Aigner and Ziegler (Chapter 26).
Week 5.
Tuesday February 7th. Graph Connectivity: Menger's Theorem.
Related Reading.
For three other proofs of Menger's Theorem, see Diestel's book (Section 3.3).
Thursday February 9th. Graph Minors; Kuratowski's theorem.
Related Reading.
For notes on graph minors, see Diestel's book (Section 1.7).
For notes on Kuratowski's theorem, see Diestel's book (Section 4.4).
Week 6.
Tuesday February 14th. Planar graphs: Fary's theorem; Planar Duality. [Assignment 2 due.]
Related Reading.
[For a deeper discussion on planar duality, see Diestel's book (Section 4.6).]
Thursday February 16th. Midterm Exam.
Week 7.
Spring Break - No Lectures.
Week 8.
Tuesday February 28th. Discrete probability: quiz and introduction.
Related Reading.
See Rosen (Sections 5.1 and 5.2) for an introduction to discrete probability.
Thursday March 1st. Conditional probability: Bayes Theorem and applications; Independence. [Assignment 3 assigned.]
Related Reading.
For more on Bayes Theorem see....
Conditional probability and independence are covered in Rosen (Section 5.2).
Week 9.
Tuesday March 6th. The Monty Hall problem; Discrete random variables and expectations.
Related Reading.
For more on the Monty Hall problem see ..... or Rosen (Section 5.1).
Random variables and expectation are covered in Rosen (Sections 5.2 and 5.3).
Thursday March 8th. The Secretary problem; the Birthday problem.
Related Reading.
An article on the secretary problem by Arnab Chakraborty.
The birthday problem is discussed in Rosen (Section 5.2).
Week 10.
Tuesday March 13th. Randomised Quicksort.; Hashing; Balls and Bins.
Related Reading.
Our proof for Randomised Quicksort can be found in Matousek and Nesetril (Section 9.4).
Some notes on hashing and balls and bins by Moses Charikar.
Thursday March 15th. Random Walks; web search engines. The Chernoff Bound. [Assignment 3 due.] [Assignment 4 assigned.]
Related Reading.
Some notes on pagerank (Section 9.2) by A.Meyer.
Week 11.
Tuesday March 20th. Applications of the Chernoff Bound: Balls and Bins; Statistical Trials; Quicksort.
Thursday March 22nd. Independent mortgages: the housing crash.
Related Reading.
Some notes on the housing crash (Section 19.5.3) by T. Leighton.
Friday March 23rd. Tutorial: Review of basic combinatorics. (McConnell Room 320, 4pm-6pm)
Related Reading.
For an introduction to combinatorics, see Biggs (Sections 11.1-11.5) or Rosen (Sections 4.1-4.5).
Week 12.
Tuesday March 27th. Bijections: labelled spanning trees; the Catalan numbers.
Related Reading.
For numerous proofs for the spanning tree problem see Aigner and Ziegler (Chapter 22), Van Lint and Wilson (Chapter 2), or Matousek and Nesetril (Chapter 7).
The Catalan numbers are .....
Thursday March 29th. The Generating Function Method: the Tower of Hanoi; the Fibonnaci numbers. [Assignment 4 due.] [Assignment 5 assigned.]
Related Reading.
See Herb Wilf's book Generatingfunctionology (Sections 1.1-1.3).
[General readings on generating functions can also be found in Rosen (Section 6.4) and Matousek and Nesetril (Sections 10.1-10.4).]
Week 13.
Tuesday April 3rd. Compositions and Convolutions: fruit, money.
Related Reading.
For more on Compositions see...
Thursday April 5th. Operations on Ordinary Generating Functions: Sum of Squares; the Catalan Numbers. [Assignment 6 posted (Optional).]
Week 14.
Tuesday April 10th. Operations on Exponential Generating Functions: Derangements; the Bell Numbers.
Thursday April 12th. Guest Lecture: De Bruijn Sequences (Aaron Williams). [Assignment 5 due.]
Week 15.
Thursday April 19th. Tutorial: Review Session. (McConnell Room 103, 4pm-6pm)
Week 16.
Monday April 23. Final Exam.