This lecture is an introduction into combinatorics, a field concerned with the existence, enumeration, analysis and optimization of discrete structures. The students are taught various combinatorial techniques, which can be applied all over mathematics.

The specific topics include:

- counting and bijections,
- generating functions,
- partial orders,
- combinatorial designs and codes,
- P'olya theory.

### Lecture Notes

The latest version of the lecture notes (updated July 19, 2016)

**Please note** that we do not guarantee for correctness or completeness.

- Here are the slides from the final lecture.

### Exercise Sheets

We will publish an exercise sheet here every Wednesday. Solutions for this sheet shall be submitted by **14:00 on Wednesday the week after**. You may submit solutions either in the problem class or in the box labeled "Combinatorics" in the courtyard of the math building (building 20.30). Every student has to prepare and submit the solutions on its own (**no submission in groups**). The solutions may be written in German or in English and each solution has to be labeled with your name and matriculation number.

Official solutions to all exercises will be published here and some solutions may be presented in the problem class. You can get your corrected solutions in the problem class or in office 1.039.

We highly recommend to work regularly on the exercise problems in order to prepare for the exam!

### Bonus

There is the possibility to obtain a bonus by successfully working the exercise sheets.

In order to receive the bonus you need to obtain at least a **third of the total amount** of points **on the first 6 sheets, as well as a third on the last 6 sheets**.

The bonus will improve the grade of a passed exam of this lecture at the end of the semester by **one step** (0.3 or 0.4).

### Exam

The written exam takes place on

**Tuesday, August 25, 2015, 8:00-11:00 AM,** in **Fritz-Haller-HS.**

The Fritz-Haller-HS was formerly called HS 37 and is located in building 20.40 (Architecture, same building as for lecture and problem class).

### Prerequisites

Basic knowledge of linear algebra.

### Language

This lecture will be taught in English.

### References

Among others this lectures will be based on the following books:

- "
*Introductory Combinatorics*" by Richard A. Brualdi - "
*A Course in Combinatorics*" by J.H. van Lint and R.M. Wilson.