Maximizing several cuts simultaneously

Details Maximizing several cuts simultaneously Maximizing several cuts simultaneously

2005-03-21

arxiv.org/abs/math/0503403v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Maximizing several cuts simultaneously does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximizing several cuts simultaneously, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximizing several cuts simultaneously will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-160180