After successful completion of the course, students are able to specify combinatorial enumeration problems by utilizing combinatorial constructions and to solve them by means of generating functions, to solve combinatorial problems on partially ordered sets, and to solve simple problems in graph theory.
Generating functins and combinatorial enumeration problems, combinatorics for partial ordered sets, Pólya's enumeration formula, introduction to graph theoretic problems
Homework exercises
Anmeldung via TISS bei Gruppen, nicht LVA-Anmeldung!
Presentation of solutions of exercises on the blackboard or online, respectively, as well as exams
Notice: Registration only in one of the groups!!
Grundlagen aus Analysis, linearer Algebra und Algebra.
