Combinatorics BMS basic Course -- Diskrete Strukturen I Summer Term 2017 Sommersemester 2017 Prof. Stefan Felsner Sprechstunde n.V. LV-Nr.: 3236 L 149 Di 10-12, MA 141 Di 16-18, MA 144 |

- News and General Information
- Contents

---> detailed contents (Vorlesungsinhalte) - Tutorial
- References

This is also the first course of the course series Diskrete Strukturen. It will be continued by Graphentheorie (Diskrete Strukturen II), Winter term 17/18.

Combinatorics is as much about problem solving as theory building, though it has developed powerful theoretical methods, especially since the later twentieth century. The goal of this course will be to provide you with a broad overview – and with a firm, concrete “working knowledge” on basic combinatorial principles, tools, methods, theories, and results.

The course will cover most of the following topics:

- Basic Counting
- Generating Functions
- Combinatorics of Finite Sets
- Posets
- Duality Theorems
- Polya Theory
- Design Theory
- Graphs and Chromatic Number
- Gray Codes and De Brujin Sequences
- Catalan Families

- Tuesday, 12:15 - 13:45, MA 550, in German, Linda Kleist
- Tuesday, 14:15 - 15:45, MA 549, in English, Linda Kleist
- Thursday, 10:15 - 11:45, MA 550, in German, Hendrik Schrezenmaier

Questions? Ask

kleist(at)math.tu-berlin.de, room MA 509 OR

schrezen(at)math.tu-berlin.de room MA 506

- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf] updated
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf] updated

At the beginning of every tutorial every participant has to mark in a list, which exercises of the current sheet she/he solved and is able to present. If somebody marks an exercise she/he is not able to present in a satisfying way, ALL exercises of this sheet will be disregarded and therefore not counted (also, each exercise is only counted once, even if presented in both tutorials). We expect a better presentation and solutions of master- and BMS students, compared to the ones, acceptable from bachelor students. To recieve a certificate for the tutorials (Schein), you have to solve at least 50% of the exercises.

To complete the modul participants have to pass an additional oral exam.

- M.Aigner: A Course in Enumeration;

Springer, 2007. - R.Graham, D.Knuth, O.Patashnik: Concrete Mathematics;

Addison-Wesely, 1989. - S.Jukna: Extremal Combinatorics;

Springer, 2001. - R.Stanley: Enumerative Combinatorics, Volume I;

Cambridge Univ. Press, 1997. - R. Stanley: Enumerative Combinatorics, Volume II;

Cambridge Univ. Press, 1999. - J.H.van Lint and R.M.Wilson: A Course in Combinatorics (2nd ed.);

Cambridge Univ. Press, 2001.

Last modified May 2017