Maximizing several cuts simultaneously
Combinatorics
2007-05-23 v1
Abstract
Consider two graphs G_1 and G_2 on the same vertex set V and suppose that G_i has m_i edges. Then there is a bipartition of V into two classes A and B so that for both i=1,2 the number of edges between A and B in G_i is (1+o(1))m_i/2. This answers a question of Bollobas and Scott. We also prove results about partitions into more than two vertex classes.
Keywords
Cite
@article{arxiv.math/0503403,
title = {Maximizing several cuts simultaneously},
author = {Daniela Kuehn and Deryk Osthus},
journal= {arXiv preprint arXiv:math/0503403},
year = {2007}
}