Time and location

Event | Time | Location | |
---|---|---|---|

Lectures | Mon 16:15 - 17:45 | Liivi 2-404 | Peeter Laud |

Practice sessions | Wed 14:15 - 15:45 | Liivi 2-404 | Margus Niitsoo |

1st test | March 23rd, 14:15 | Liivi 2-404 | |

May 31st, 9:00 | Liivi 2-207 | ||

2nd test | April 18th, 16:15 | Liivi 2-404 | |

June 3rd, 9:00 | Liivi 2-207 | ||

3rd test | May 25th, 14:15 | Liivi 2-404 | |

June 6th, 9:00 | Liivi 2-207 |

**Grading:** there will be three tests during the term, each worth 28 points
(possible to repeat during the exam session; the last attempt will count).
There is also possibility to collect extra points (up to 5) in the practice
sessions. The grading will be done as if the maximum number of points were
80.

The tasks in the tests will be similar in nature to the tasks considered in practice
sessions, hence it makes sense to visit at least the practice sessions
regularly.

The contents of the lectures is similar to the previous years. The
electronic version of our lecture notes (in Estonian) is available here. Our most important
source for these lectures has been the textbook *Introduction to Graph
Theory* by Robin J. Wilson (4th edition published by Addison-Wesley in
1996), although it does not contain all proofs that we give in the lectures.
Other books of elementary graph theory can undoubtedly serve as references,
too.

News:

- There is no lecture on May 9th. Also, there are no meetings of the class on the week of May 16th-20th.
- Fixed the dates for the second attempts of the tests. Not that you can retry any number of tests. Your last attempt will count in the final score.
- Fixed the dates for three tests during the semester.
- The lecture on February 28th and the practice session on March 2nd are given by Liina Kamm.

Slides of the lectures will appear below. They won't be much different from the previous times this course has taken place.

- February 7th
- February 14th
- February 21st
- February 28th
- March 7th
- In March 14th, we will first prove Menger's theorem for vertices. Then we will study matchings in bipartite graphs and see how to find maximum matchings in any graph.
- In March 28th, we continue where we left off in the previous lecture. After considering the finding of maximum matchings in graphs, we will then also present a necessary and sufficient condition for a graph to have a perfect matching.
- April 4th — coloring the edges of a graph.
- April 11th — planarity
- April 25th — coloring vertices
- May 2nd — Ramsey theory and probabilistic proofs.