Introduction to Graph Theory
Umeå University
Startdatum:
Slutdatum:
Studietakt: 50 %
Publicerad utbildningskatalog
Utbildningsinformation från den publicerade källan. Utbildningen och dess tidsbundna tillfällen hålls åtskilda.
Kod: 5MA146
The course treats grapph theoretical notions and problems, and the use of algorithms, both in the mathematical theory of graphs and its applications. In the course, the basic theory of graphs of different kinds is developed in detail, especially trees and bipartite graphs. In the course some of the algorithms that totally or partly solve graph theoretical problems are presented. An example of such a problem is to find a matching of maximum weight, and another is to find a maximum flow in a network. The theory for matchings and Hall's theorem are treated, as well as spanning trees and Menger's theorem. Further, the theory of vertex and edge colouring, including Brooks' theorem and Vizing's theorem, are presented. Finally, an introduction to matroid theory is included.
The course requires courses in Mathematics, minimum 60 ECTS or at least two years of university studies and in both cases a course in discrete mathematics, minimum 7,5 ECTS or equivalent. Proficiency in English equivalent to the level required for basic eligibility for higher studies. Where the language of instruction is Swedish, applicants must prove proficiency in Swedish to the level required for basic eligibility for higher studies
Varje tillfälle har egna datum och villkor. Avslutade tillfällen behålls som historik och innebär inte att en ny ansökan är öppen.
Umeå University
Startdatum:
Slutdatum:
Studietakt: 50 %
Hämtad: .
Publicerad: .
Publiceringsversion: 8e217193-f5fa-4778-b085-a4521fd03e8d
Kontrollsumma: 1b0dc54c0fc8a359f83ba9dc8f9d468479ce432de4c03bce3b8b33dd67fe3f6c
Senast ändrad enligt källan: 2026-02-02T12:25:15