Modulets indhold, forløb og pædagogik

Læringsmål

Viden

• know about connectivity in graphs and Menger’s Theorem.
• know about planarity and minors
• know about graph colouring 
• know about shortest and longest cycles in graphs
• know about results in extremal graph theory
• know about probabilistic and/or (linear) algebraic methods applied to graphs

Færdigheder

• are able to demonstrate knowledge of survey central concepts and results from graph theory
• are able to prove central results from the module
• are able to apply relevant concepts to examples

Kompetencer

• are able to independently prove small results using combinatorial reasoning  possibly in conjunction with algebraic/probabilistic arguments

Undervisningsform

Forelæsninger med tilhørende opgaveregning.

Omfang og forventet arbejdsindsats

Kursusmodulets omfang er 5 ECTS svarende til 150 timers studieindsats.

Eksamen

Prøver