Higher Combinatorics (generating functions, labeled and unlabeled structures, asymptotic methods, combinatorics on partial ordered sets, matroids), Graph Theory (special graphs, net works, graph algorithms, colorings and matchings, Ramsey theory), Number Theory (prime numbers, Euclidean algorithm, linear congruences, congruence classes, Euler-Fermat theorems, Chinese remainder theorem, finite fields, applications in cryptography and coding), Topology (neighborhood, connectedness, oriented surfaces, simplicial complex, topological and geometric graph theory)
Vorbesprechung und 1. Vorlesung am 5.10.2010.
Am 19.10.2010 findet die Vorlesung von 8:15-9:45 statt.
