Max k-cut and judicious k-partitions


Alon, et al. (2003) [1] proved that every graph with a large cut has a bipartition in which each vertex class contains correspondingly few edges. We prove an analogous result for partitions into k ≥ 3 classes; along the way we prove a result for biased bipartitions. © 2010 Elsevier B.V. All rights reserved.

Publication Title

Discrete Mathematics