discipline

Mathematics, Applied mathematics

subject

 Combinatorial optimization structures

lecturers

 András Frank

credits

 

period

 2 or 4

curriculum

T-joins and T-cuts (Sebő's lemma, theorems of Lovász and Seymour).  Mader's undirected splitting off theorem. Local edge-connectivity augmentation in undirected graphs. Node-connectivity augmentation in directed graphs. Algorithmic packing of chains and antichains in posets (theorems of Greene and Greene-Kleitman), A weighted matroid intersection algorithm. An algorithmic proof of the theorem of Lucchesi and Younger. Nash-Williams' strong orientation theorem.

literature

 

form of tuition

Lectures

mode of assessment

written/oral exam