Skip to content
printicon
Main menu hidden.

Graph Theory

  • Number of credits 7.5 credits

About the course

The course treats more advanced topics in the theory of matchings and colourings of graphs, and introduces several additional topics in advanced graph theory. In the theory of matchings, minimax theorems, and stable matchings in bipartites graphs are treated, along with Tutte's theorem on matchings and the flower algorithm for finding perfect matchings in general graphs. In graph colouring theory, the structure of graphs with a certain chromatic number is studied, and special classes where colouring problems can be solved efficiently are studied. Further topics in the course includes Ramsey theory, random graphs, and eigenvalues of graphs.

Contact us

Please be aware that the University is a public authority and that what you write here can be included in an official document. Therefore, be careful if you are writing about sensitive or personal matters in this contact form. If you have such an enquiry, please call us instead. All data will be treated in accordance with the General Data Protection Regulation.

Contactperson for the course is:
Study counselor Lars-Daniel Öhman