Judicious partitions of graphs
Graphs, Hypergraphs, and Computing
11 February 15:30 - 16:30
Benjamin Sudakov - University of California, UCLA
The 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.
Magnus M. Halldorsson
Adam Mickiewicz University
Technical University of Denmark, DTU