discipline 
Mathematics, Applied mathematics

subject 
Combinatorial
optimization structures

lecturers 
András Frank 
credits 

period 
2 or 4 
curriculum 
Tjoins and Tcuts (Sebő's
lemma, theorems of Lovász and Seymour). Mader's
undirected splitting off theorem. Local edgeconnectivity augmentation in
undirected graphs. Nodeconnectivity augmentation in directed graphs.
Algorithmic packing of chains and antichains in posets (theorems of Greene and GreeneKleitman),
A weighted matroid intersection algorithm. An
algorithmic proof of the theorem of Lucchesi and
Younger. NashWilliams' strong orientation theorem. 
literature 

form of tuition 
Lectures 
mode of assessment 
written/oral
exam 