Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Home

Only search content I have access to

Home

Log in
Register
Browse subjects
What we publish
Services
About Cambridge Core
Cart

Cart

Institution login
Register
Log in
Cart

< Back to search results

Home
Search

Search Results

Refine search

Access:

Only show content I have access to (0)

Content type:

Articles (1)

Author:

Publication date:

Over 3 years (1)

From year:

To year:

Apply

Subject: Show more

Computer Science (1)

Mathematics (1)

Statistics and Probability (1)

Actions for selected content:

Select all | Deselect all

View selected items
Save to my bookmarks
Export citations
Download PDF (zip)
Send to Kindle
Send to Dropbox
Send to Google Drive

Send content to

To send content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to .

To send content items to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Please be advised that item(s) you selected are not available.

You are about to send

Your Kindle email address

Please provide your Kindle email.

@free.kindle.com @kindle.com (service fees apply)

By using this service, you agree that you will only keep articles for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services Please confirm that you accept the terms of use.

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Search Title: required Please provide a title, maximum of 40 characters.

Cancel

1 results

Maximizing Several Cuts Simultaneously
DANIELA KÜUHN, DERYK OSTHUS
Journal: Combinatorics, Probability and Computing / Volume 16 / Issue 2 / March 2007
Published online by Cambridge University Press: 01 March 2007, pp. 277-283
Print publication: March 2007
- Article
- Export citation
View abstract

Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that, for both i = 1, 2, we have . This gives an approximate answer to a question of Bollobás and Scott. We also prove results about partitions into more than two vertex classes. Our proofs yield polynomial algorithms.