VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.
251-0458-00L
5
Credits
BSC
,
DS
,
MSC
D-MATH
,
D-INFK
Extremal Combinatorics
Lecturers & Examiners:
Prof. Dr. Tibor Szabo
Last Updated: 2026-02-05 15:19:52
Abstract
Turan-type problems for graphs are studied in depth. A special emphasis is given to algebraic constructions. Explicit constructions for various Ramsey-type problems are also treated. The very basics of the probabilistic method is also introduced.
General Information
- Language
- English
- Levels
- BSC , DS , MSC
- Frequency
- Yearly recurring
Examination
- Type
- session examination
- Mode
- oral 30 minutes
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| lecture | Extremal Combinatorics |
|
2 h weekly |
| exercise | Extremal Combinatorics |
|
1 h weekly |