15-344

DBN: Classes: 2015-16: 15-344 / Navigation Welcome to Math 344! Edits to the Math 344 web sites no longer count for the purpose of good deed points. # Week of... Notes and Links 1 Sep 14 About This Class, Day One Handout, Tuesday, Hour 3 Handout, Thursday, Tutorial 1 Handout 2 Sep 21 Tuesday, Tutorial 2 Page 1, Tutorial 2 Page 2, Thursday, HW1 3 Sep 28 Tuesday, Class Photo, Tutorial 3 Page 1, Tutorial 3 Page 2, Thursday, HW2 4 Oct 5 Tuesday, Drawing $n$-cubes, Thursday, HW3 5 Oct 12 Tuesday, Tutorial Handout, Thursday, HW4 6 Oct 19 Tuesday, Tutorial Handout, Thursday 7 Oct 26 Term Test on Tuesday, Dijkstra Handout,Thursday,HW5 8 Nov 2 Tuesday, Tutorial Handout, Thursday, HW6, Sunday November 8 is the last day to drop this class 9 Nov 9 Monday-Tuesday is UofT Fall Break, Thursday, HW7 10 Nov 16 Tuesday, Thursday, HW8 11 Nov 23 Tuesday, Thursday, HW9 12 Nov 30 Tuesday, Thursday, HW10 13 Dec 7 Tuesday, FibonacciFormula.pdf, semester ends on Wednesday - no class Thursday F Dec 11-22 The Final Exam Register of Good Deeds Add your name / see who's in!

Introduction to Combinatorics

Department of Mathematics, University of Toronto, Fall 2015

Agenda: Understand graphs and learn to count.

Instructor: Dror Bar-Natan, drorbn@math.toronto.edu (no math over email!), Bahen 6178, 416-946-5438. Office hours: by appointment.

Classes: Tuesdays 3-5 at MP 202 and Thursdays 2-3 at MP 203.

Teaching Assistant: Gaurav Patil (g.patil@mail.utoronto.ca). Office hours: Mondays 3:30-4:30PM at 215 Huron, room 1012, and Tuesdays 6-7PM at math department lounge, on the 6th floor of the Bahen building. Tutorials: Two sessions - Thursdays 4-5 and Thursdays 5-6, both at LM 158.

Text

Our main text book will be Applied Combinatorics (sixth edition) by Alan Tucker, ISBN 978-0-470-45838-9; it is a required reading.

Further Resources

• Undergraduate Information at the UofT Math Department

• Undergraduate Course Descriptions.

• 1999 class, by Steve Tanny.

• 2002 class, by Andres Del Junco.

• 2008 class, by Dilip Raghavan.

• My 15-344 notebook.

• Some blackboard shots.

Dror's notes above / Students' notes below

If you are reading section 7.1 in our textbook, you may find example 3 intriguing. There is actually a solution to this problem using graph theoretic tools (to be precise, Euler's formula).

Graph Theory Revisited: Euler's Formula and a Combinatorial Problem