Benjamin Sudakov: Judicious partitions of graphs
Time: Tue 2014-02-11 15.30 - 16.30
Location: Institut Mittag-Leffler, Auravägen 17, Djursholm
Participating: Benjamin Sudakov, University of California, UCLA
he area of judicious partitioning considers the general family of partitioning problems for graphs and hypergraphs in which one seeks to optimize several parameters simultaneously. These problems have been widely studied in various combinatorial contexts. In this talk we discuss several fundamental questions in this area, resolving conjectures of Bollobas and Scott.
Joint work with C. Lee and P. Loh.