Seminar

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.
Organizers
Magnus M. Halldorsson
Reykjavik University
Klas Markström
Umeå University
Andrzej Rucinski
Adam Mickiewicz University
Carsten Thomassen
Technical University of Denmark, DTU

Program
Contact

Klas Markström

klas.markstrom@math.umu.se

Other
information

For practical matters at the Institute, send an e-mail to secretary@mittag-leffler.se