401-3052-10L  Graph Theory

SemesterSpring Semester 2020
LecturersB. Sudakov
Periodicityyearly recurring course
Language of instructionEnglish



Courses

NumberTitleHoursLecturers
401-3052-10 VGraph Theory4 hrs
Wed10-12ER SA TZ »
10-12HG E 5 »
Thu10-12ER SA TZ »
10-12HG F 3 »
B. Sudakov
401-3052-10 UGraph Theory1 hrs
Thu15-16CAB G 52 »
15-16CAB G 56 »
15-16HG E 21 »
17-18HG E 33.5 »
B. Sudakov

Catalogue data

AbstractBasics, trees, Caley's formula, matrix tree theorem, connectivity, theorems of Mader and Menger, Eulerian graphs, Hamilton cycles, theorems of Dirac, Ore, Erdös-Chvatal, matchings, theorems of Hall, König, Tutte, planar graphs, Euler's formula, Kuratowski's theorem, graph colorings, Brooks' theorem, 5-colorings of planar graphs, list colorings, Vizing's theorem, Ramsey theory, Turán's theorem
ObjectiveThe students will get an overview over the most fundamental questions concerning graph theory. We expect them to understand the proof techniques and to use them autonomously on related problems.
Lecture notesLecture will be only at the blackboard.
LiteratureWest, D.: "Introduction to Graph Theory"
Diestel, R.: "Graph Theory"

Further literature links will be provided in the lecture.
Prerequisites / NoticeStudents are expected to have a mathematical background and should be able to write rigorous proofs.

Performance assessment

Performance assessment information (valid until the course unit is held again)
Performance assessment as a semester course
ECTS credits10 credits
ExaminersB. Sudakov
Typesession examination
Language of examinationEnglish
RepetitionThe performance assessment is only offered in the session after the course unit. Repetition only possible after re-enrolling.
Mode of examinationwritten 180 minutes
Additional information on mode of examinationThe exams for the two course units 401-3052-10L (core course 4V+1U) and 401-3052-05L (elective course 2V+0.5U) take place simultaneously (3 hours).
Written aidsStudents are allowed to bring ONLY a printed copy of the lecture notes with no extra writing (highlighting and blank post-its are allowed).
This information can be updated until the beginning of the semester; information on the examination timetable is binding.

Learning materials

 
Main linkMoodle webpage of the course
Only public learning materials are listed.

Groups

No information on groups available.

Restrictions

There are no additional restrictions for the registration.

Offered in

ProgrammeSectionType
Data Science MasterCore ElectivesWInformation
Mathematics BachelorCore Courses: Applied Mathematics and Further Appl.-Oriented FieldsWInformation
Mathematics MasterCore Courses: Applied Mathematics and Further Appl.-Oriented FieldsWInformation