Combinatorics (Math 4707), Spring 2018

Darij Grinberg

Moodle site for 4707.

Main resources:


Quick book references (italics = free): Loehr (errata); Graham/Knuth/Patashnik (errata); Bogart; Bóna; Galvin; Lehman/Leighton/Meyer.

Basics on equivalence relations and equivalence classes: class materials by Melissa Lynn and by Jonathan Rogness (part 1 and part 2).

Extra notes: Network flows (sourcecode); this includes definitions of simple digraphs and multidigraphs.

See Math 5707 from Spring 2017 for some graph theory, specifically lecture 9 for trees and their many definitions.

See Math 4707 from Fall 2017 for some solved exercises.

"Black"board writing:

(Jan 29: Vic Reiner was substituting, talking about Inclusion/Exclusion and the Multinomial Formula. See Sections 16 of Galvin for the former and the WP for the latter.)
(Fri 28: Vic Reiner was substituting, talking about Catalan numbers.)
(Mar 7: Vic Reiner was substituting, talking about generating functions.)

Homework and other problems:

A LaTeX template for those who want to write their solutions in LaTeX. (Compiled PDF.)

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.