Advanced and algorithmic graph theory
LV-Nr. MAT.464UF (Lecture)
MAT.465UF (Exercises)
J. Erde, P. Sprüssel
Institute of Discrete Mathematics
Summer term 2021

Course dates

The courses take place from 1st March 2021 until 21st June 2021, each monday from 2:15PM to 4:00PM and each tuesday from 4:15PM to 6:00PM. The exercises will always be at the monday time slot, roughly every other week, starting on 15th March.

See TUGonline (lecture / exercises) for a complete list of dates.

Due to Covid19 measures, this course will entirely be held online; this applies to both lectures and exercise sessions. It is not compulsory to attend the online lectures; it is only compulsory to attend the online exercise sessions if you have marked an exercise.

Technical requirements

In order to attend the online lectures, you will need to be able to attend Webex meetings. For presenting solutions during the exercises, your device will need to have a working microphone. A webcam or a tablet (in order to write on the screen) would be a plus, but are not strictly necessary.

Grading

Lecture

The exams for this course will be oral, appointments for exams should be made directly with either of the lecturers.

Exercises

The exercise sheets will be available about a week before the respective exercise session. You can then use an online system (a link will be provided below) to mark which exercises you solved. The deadline for marking is precisely one hour before the start of the session. After the deadline, no changes can be made. The choice of who shall present which solution in class is made by a random generator. If you mark an exercise, you need to be present at the respective exercise session.

Attention: Keep in mind that you present your solution via a video conference. The optimal way would be if you have the possibility to write the solution during the presentation (e.g. using a tablet or a camera filming you writing on paper). If such methods are not available to you, prepare your written solution as a file (e.g. scan or photograph the handwritten solution) that you can then share during the exercise session while verbally explaining the solution.

The total number of points is the sum P of the points S gained by solving exercises and the points B for presenting solutions at the board. Depending on P, the grade will be



P < 20   nicht genügend (5),
20 P < 25   genügend (4),
25 P < 30   befriedigend (3),
30 P < 35   gut (2),
35 P

  sehr gut (1).

Points for solving exercises

Up to 30 points can be earned by marking exercises. For each sheet, the points awarded for marking the exercises on this sheet will be

6 x (marked exercises) / (exercises on this sheet).

Out of the six exercise sessions, the best five will be counted for the total points S.

If you miss a session, you will not be awarded any points for that session. Points lost by missing more than one session cannot be compensated.

Points for presenting solutions

Depending on the quality of the solution and the presentation, between 0 and 5 points will be awarded for each presentation. The two best presentations will be counted for the total points B.

You should present solutions in a way that enables the other participants to follow your arguments. If it becomes apparent that someone did not do an exercise they marked in the system (it is fine if the exercise has been done, but mistakes have been made), this can be penalised by scaling all points from all exercise sessions by 0.5.

Online system for marking exercises

Before you log in for the first time, enter your student ID number; the system will then automatically send a password to your student email address. The system will update the list of participants each day. If you have just registered for the course, it may take up to 24 hours until the system recognises you.
The online system is available under the following link:

Literature

All course materials (lecture notes, exercise sheets) will be made available via the TeachCenter course. (The link will be changed to the current year's course at 25th February.)

B. Bollobas: Modern Graph Theory

R. Diestel: Graph Theory


Last modified 2nd February 2021