Graphs, Capacities, Entropies: Introduction to Information Theoretic Combinatorics (Fall semester, 2022)
Grading: 76% comes from the oral exam to be taken in the exam period, 24% from the homeworks. The result is converted to marks according to the following thresholds: the final grade is a 5 if you achieved at least 85%, 4 if less but at least 70%, 3 if less but at least 55% and 2 if less but at least 40%. Below that no valid grade can be received.
Homeworks: Two times during the semester I will give a few problems to solve at home during one week each time. In both cases the complete solution of all problems will worth 12 points. The 24 points thus maximally achievable will give 24% of the final grade (see above). The two homeworks will be handed out at the Friday lecture of the 5th and 10th week (that is, October 7 and November 11), respectively and will be due a week later, that is October 14 and November 18, respectively.
Reinhard Diestel's Graph Theory book is a very nicely written textbook that contains a lot of useful background material. .
Here is the paper entitled Graph Entropy: A Survey to which I refer to several times in the lecture notes.
First homework sheet (Fall 2022, due October 14.)
Second homework sheet (Fall 2022, due November 18.)