Thomas Zaslavsky
Past Courses

  • Math 221 (Fall 2007): Calc I, Sections 11 and 17
    Information page for my sections.
  • Math 386 (Fall 2006): Combinatorics
    Course home page.
  • Math 581 (Fall 2006): Topics in Graph Theory: Algebraic Graph Theory
    Textbook: Algebraic Graph Theory by Godsil and Royle, supplemented with signed graphs.
    Course home page.

  • Math 304 (Spring 2006): Linear Algebra
    Course home page. Textbook: Brin.
  • Math 510 (Spring 2006): Introduction to Graph Theory
    Textbook: Graph Theory by Reinhard Diestel, third edition (2005).
    Course home page.
  • Math 386 (Fall 2005): Combinatorics
    Course home page.
  • Math 580A (Fall 2005): Topics in Combinatorial Analysis: Lattice Points and Biased Graphs
    This will focus on my research interests. It will not require any previous courses, but it does require maturity. The exact topics and treatment will depend on who takes the class. Textbook: Matthias Beck and Sinai Robins, Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra, preliminary edition.
    Course home page.

  • Math 511 (Spring 2005): Introduction to Combinatorics
    Chapters 1-3 of Stanley's book Enumerative Combinatorics, Volume 1.
    Course home page.
  • Math 386 (Fall 2004): Combinatorics
    Course home page.
  • Math 580A (Fall 2004): Topics in Combinatorial Analysis: Introduction to Matroid Theory
    From Oxley's book Matroid Theory.
    Course home page.

  • Math 381 (Spring 2004): Graph Theory
    Home page.
  • Math 580A (Spring 2004): Topics in Combinatorial Analysis: Introduction to Graph Theory and Invariants (Tutte version II)
    Introduction to graph theory; matchings and factorization; invariants (all from Tutte's book Graph Theory). Invariants of matroids (introduction).
    Home page.
  • Math 386 (Fall 2003): Combinatorics
    Home page.

  • Math 381 (Spring 2003): Graph Theory
    Home page.
  • Math 581 (Spring 2003): Topics in Graph Theory: Introduction to Graph Theory (Tutte version I)
    Basic graph theory; variations on Menger's theorem; 2-connected and 3-connected structure; arborescences, matrix-tree theorem, and Eulerian tours; chain groups and their applications to graphs. All from Tutte's book, Graph Theory.
    Home page.
  • Math 386 (Fall 2002): Combinatorics
    Home page.
  • Math 580B (Fall 2002): Topics in Combinatorial Analysis: Introduction to Combinatorics
    Textbook: van Lint and Wilson, A Course in Combinatorics.
    Home page.

  • Math 314 (Spring 2002): Discrete Mathematics
    Home page.
  • Math 381 (Spring 2002): Graph Theory
    Home page.
  • Math 580A (Spring 2002): Topics in Combinatorial Analysis: Advanced Matroid Theory and Biased Graphs
    Home page.
  • Math 580 (Fall 2001): Topics in Combinatorial Analysis: Introduction to Matroid Theory
    Textbook: Oxley, Matroid Theory.
    Home page.

  • Spring 2001 381
  • Spring 2001 580 (Combinatorics of Finite Sets: Anderson)
  • Fall 2000 Math 222
  • Fall 2000 Math 386

  • Fall 1999 Math 304
  • Fall 1999 Math 386

  • Spring 1999 Math 304
  • Spring 1999 Math 581
  • Fall 1998 Math 304

  • Spring 1998 Math 386
  • Fall 1997 Math 222
  • Fall 1997 Math 381

  • Spring 1997 Math 221
  • Spring 1997 Math 386
  • Fall 1996 Math 222

  • My home page.