# Description

In this seminar we consider some classical problems in combinatorics and graph theory. Every student presents one such problem in a talk. The material is taken from the following two books.

**Proofs from THE BOOK**by G. M. Ziegler**Thirty-three Miniatures**by J. Matousek

Both books are available at the KIT library. "Proofs from THE BOOK" is even available as an online ressource. If you need help with accessing "Thirty-three Miniatures", please contact us.

# List of Talks

The following is the schedule for the seminar. Each topics comes with a list of the relevant chapters from "Proofs from THE BOOK" (labeled *P*) and "Thirty-three Miniatures" (labeled *M*).

date | speaker | topic | sources |

Nov 18 | Fabrizio | Pigeon-hole and Double Counting | P27 |

Nov 25 | Anika | Decomposition of Graphs | P11, P43, M6, M8 |

Dec 2 | Pascal | Cayley's Formula for the Number of Trees | P32 |

Dec 9 | Rameez | The finite Kakeya Problem | P34, M25 |

Dec 16 | Ann-Katrin | Completing Latin Squares | P35 |

Jan 13 | Marianne | Tiling Rectangles | P28, M12 |

Jan 20 | --- | --- | --- |

Note that you do not have to present all the material in the corresponding chapters. You may choose yourself which material to present or contact us in this respect.

# Successful Participation

Every student prepares a talk based on a chapter in one of the two books. Successful participation in this seminar includes, besides a well-prepared talk, presence in the seminar and active participation.

# Prerequisites

Solid knowledge of linear algebra and proof techniques.

# Language

The seminar will be exclusively taught in **English**. This concerns the provided material, the talks of students, as well as the supervision by the lecturers.