SUBJECT
Title
Structures in combinatorial optimization
Type of instruction
lecture
Level
master
Faculty
Part of degree program
Credits
3
Recommended in
Semesters 1-4
Typically offered in
Autumn/Spring semester
Course description
Chains and antichains in partially ordered sets, theorems of Greene and Kleitman.
Mader's edge splitting theorem. The strong orientation theorem of Nash-Williams.
The interval generator theorem of Győri.
Readings
- A. Frank, Structures in combinatorial optimization, lecture notes
Further reading:
- A. Schrijver, Combinatorial Optimization: Polyhedra and efficiency, Springer, 2003. Vol. 24 of the series Algorithms and Combinatorics.