|Lecture:||Monday 9:45-11:15||Grashof-Hörsaal||Begin: 14.10.2019|
|Friday 14:00-15:30||SR 1.067|
|Problem class:||Wednesday 11:30-13:00||SR 1.067|
|Lecturer||Prof. Dr. Maria Axenovich|
|Office hours: Mon. 13:00-14:00 (available per e-mail or Skype)|
|Room 1.043 Kollegiengebäude Mathematik (20.30)|
|Email: firstname.lastname@example.org||Problem classes||Dr. Richard Snyder|
|Room 1.045 Kollegiengebäude Mathematik (20.30)|
The course will be concerned with topics in classical and modern graph theory:
- Properties of trees, cycles, matching, factors
- Forbidden subgraphs
- Planar graphs
- Graph colorings
- Random graphs
- Ramsey theory
- Graph minors
The class is oriented towards problem solving. The goal of the course for the students is to gain knowledge about the fundamental concepts in graph theory, solve interesting problems, learn how to write and present the proofs creatively.
Basic knowledge of linear algebra; appropriate for students starting from 5th semester.
A problem sheet will be published here every Wednesday (starting on October 16) with 4 problems for 5 points each. The due date is Wednesday the following week at 10:50 am.
Rules of submission:
- In each paper that you submit, you shall leave a right margin of width at least 1/3 of the paper so that the tutors have enough space to write their comments.
- The submitted pages must be stapled together with the cover sheet, and your name(s) must be written in capital letters. You can find the cover sheet here.
- The problems are solved and solutions are submitted by individual students or pairs of students. If you plan on specializing in Discrete Mathematics, then we advise you to submit your solutions individually.
- Every submission shall contain the solution to at most three problems.
- When submitting in pairs, each student shall write at least one solution.
- You can write your solutions either in English (preferable) or in German.
- You shall submit your solutions in a green box labeled "Graph Theory" in the atrium of the math building (20.30).
There is the possibility to obtain a bonus by successfully working the exercise sheets.
In order to receive the bonus you need to obtain at least half of the total amount of points on the first 6 sheets, as well as on the second 6 sheets (i.e., you need to receive at least 45 points on the first 6 sheets, and at least 45 points on the second 6 sheets).
The bonus will improve the grade of a passed exam of this lecture at the end of the semester by one step (0.3 or 0.4).
The main source is the book Graph Theory by Reinhard Diestel. The English edition can be read for free on the author’s web site (http://diestel-graph-theory.com/).
- D. West -- Introduction to graph theory
- B. Bollobás -- Modern graph theory
- A. Bondy and U.S.R. Murty -- Graph Theory
- L. Lovász -- Combinatorial problems and exercises
- G. Chartrand, L. Lesniak and P. Zhang -- Graphs & Digraphs
There are lecture notes containing all relevant definitions, notation and theorems from the lecture. The first set of lecture notes contains full proofs, while the short version only contains definitions and statements of theorems.
- lecture notes: ( pdf | last updated on 31.01.2020)
- lecture notes (short version): ( pdf | last updated on 07.02.2020)