Instructor:  Dr. Dezsõ MIKLÓS
Text: classnote handouts and Miklós Bóna: A walk through combinatorics

Topics:

Basic counting rules (product rule, sum rule, permutations, combinations, Pascal's triangle, occupancy problems, distribution problems, Stirling numbers).

Generating functions (definition, operations on generating functions, applications to counting, binomial theorem,
exponential generating functions).

Recurrences (Fibonacci numbers, derangements, the method of generating functions).

Principle of inclusion and exclusion (the principle and applications, occupancy problems with distinguishable balls and
cells, derangements, the number of objects having exactly m properties).

Introductory graph theory (quick overview of fundamental concepts, connectedness, graph coloring, trees;   Cayley's theorem on the number of trees).

Pigeonhole principle and Ramsey theory (Ramsey's theorem, bounds on Ramsey numbers, applications).

Symmetric combinatorial structures, block designs (definition, Latin squares, finite projective planes).

Homework sets:
info sheet, HW 1, HW 2, HW 3, HW 4, HW 5, Sample midterm, HW 6, HW 7, Extra HW re generating functions, Extra HW re recurrence relations, HW 8, HW 9, HW 10, HW 11, HW 12, HW 13, additional text for symmetric structures