Combinatorics (Math 4707 and Math 4990), Fall 2017
Darij Grinberg (203B Vincent Hall)
This site is moving to https://www.cip.ifi.lmu.de/~grinberg/t/17f/ ! Please change your links and references.
Not yet available: my lecture notes (currently, the PDF just has references).
David Galvin's notes "Basic discrete mathematics". This is a rather nice set of notes that will have a lot of overlap with this class. Please mail firstname.lastname@example.org for questions and comments (I am maintaining these notes currently).
Quick book references: Loehr (errata); Graham/Knuth/Patashnik (errata); Bogart; Bóna.
Basics on equivalence relations and equivalence classes: class materials by Melissa Lynn and by Jonathan Rogness (part 1 and part 2).
Extra notes: Why log and exp are inverse; Sandpiles with proofs (HW5 from 5707S17).
See Math 5707 from Spring 2017 for some graph theory, specifically lecture 9 for trees and their many definitions.
Blackboard writing from 4990 (only from the second half of the semester):
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.