Max \(k\)-cut and judicious \(k\)-partitions

DOI10.1016/j.disc.2010.04.004zbMath1227.05171MaRDI QIDQ982619

Béla Bollobás, Alexander D. Scott

Publication date: 7 July 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.04.004

zbMATH Keywords

extremal graph theory; max cut; judicious partitions

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)