After successful completion of the course, students are able to formulate important concepts of
enumerative combinatorics, to specify enumeration problems by utilizing combinatorial
constructions and to solve them by means of generating functions, to understand relations between
combinatorics and partial orders, to understand and formulate the outline of Polya's enumeration
theory, to formulate important definitions and results from graph theory.

Generating functins and combinatorial enumeration problems, asymptotic methods, combinatorics for partial ordered sets, Pólya's enumeration formula, introduction to graph theoretic problems

Explanations on the blackboard.

The lecture starts on Monday, March 2.

Exam

Grundkenntnisse aus Analysis, linearer Algebra und Algebra