Date  Chapter  Description 


Jan 12  4.1  Introduction 
Jan 14  1.3, 3.1  Counting words and functions 
Jan 16  3.2  3.3  Counting permutations and injective functions 

Jan 19   Martin Luther King Day! (no class) 
Jan 21  3.3  Binomial coefficients, complement formula 
Jan 23  3.3  Pascal's triangle, the Binomial Theorem 

Jan 26  3.3  Proof and applications of the Binomial Theorem 
Jan 28  3.3  More applications of the Binomial Theorem 
Jan 30  3.3  Multinomials, and more counting problems 

Feb 2  3.7  The InclusionExclusion principle 
Feb 4  3.8  Derangements 
Feb 6  4.1  Graph examples, isomorphisms 

Feb 9  4.1  Isomorphism examples, automorphisms 
Feb 11  4.2  Automorphism examples, subgraphs, paths 
Feb 13  4.2  Connected graphs, walks 

Feb 16  4.2  Distance, diameter 
Feb 18  Exam 1 
Feb 20   (Exam solutions) 

Feb 23   Snow day (class cancelled) 
Feb 25   Snow day (class cancelled) 
Feb 27  4.2  Adjacency matrices and the # of walks 

Mar 2  4.3  Degrees and the Handshake Lemma 
Mar 4  7.1  Sperner's Lemma 
Mar 6  4.4  Eulerian tours 

Mar 9   Spring Break! (no class) 
Mar 11   Spring Break! (no class) 
Mar 13   Spring Break! (no class) 

Mar 16  4.4, 4.6  Multigraphs, 2connectivity 
Mar 18  4.6  Cycle characterization of 2connected 
Mar 20  4.6  Ear decomposition characterization of 2connected 

Mar 23  5.1  Trees: definition and leaf lemmas 
Mar 25  5.1  Tree characterizations 
Mar 27  5.1  Spanning trees 

Mar 30  5.3  Spanning tree algorithms 
Apr 1  Exam 2 
Apr 3   Religious holiday! (no class) 

Apr 6  5.3  Matroid structure of spanning trees 
Apr 8  6.1  Planar graphs basics 
Apr 10  6.1  Faces of planar graph 

Apr 13  6.1  Drawing on other surfaces 
Apr 15  6.1  Stereographic projection 
Apr 17  6.2  Cycles and the Jordan Curve Theorem 

Apr 20  6.2  Kuratowski's Theorem 
Apr 22  6.2  More on faces and cycles 
Apr 24  6.3  Euler's Theorem 

Apr 27  6.4  Map coloring 
Apr 29  6.4  The 5color Theorem 

May 5  Final exam (3:00  6:00pm) 