After successful completion of the course, students are able to carry out graph theoretical proofs, to describe and apply important graph theoretical concepts and algorithms, to apply advanced methods in combinatorics, number theory and algebra as well as to solve exercises in applications of the theory of finite fields.

Higher Combinatorics, Graph Theory, Number Theory, Polynomials over Finite Fields

The exercise sheets will be posted on TUWEL system.

Solved exercises must be indicated by ticking the appropriate boxes in the TUWEL system.

Exercise sessions take place in presence on Tuesday in two groups, G1 9:00-11:00 and G2 11:00-13:00, on the following tentative dates:

18.10, 25.10., 8.11, 22.11., 29.11., 6.12., 13.12., 20.12., 10.01., 17.01., 24.01.