discipline 
MSC in
Mathematics, Pure Mathematics, Elective Course

subject 
Combinatorial
Convexity 
lecturers 
Dr. Károly Bezdek (professor), Dr. Károly Böröczky (professor), Dr. Károly Böröczki Jr. (associate professor), Dr. Gábor Kertész (assistant professor). 
credits 
2 
period 
2nd semester 
curriculum 
EulerPoincaré
theorem, DehnSommerwill equations. Cyclic polytopes. Upper bound theorem,
Galetransform. Random polytopes for Gaussdistribution, Koebe’s circle
theorem about planar graphs, Steinitz’s theorem, edge graphs of polytopes
(Balinski’s theorem). Universality theorem. Convex hull algorithms. Ellipsoid
algorithm. Polynomial algorithm for counting lattice points. 
literature 
B. Grünbaum: Convex polytopes, 2nd edition,
SpringerVerlag, 2003. 
form of tuition 
Two hours of lecture per week. 
mode of assessment 
oral exam 