Judicious partitions of bounded-degree graphs

  • Authors:

  • B. Bollobás;A. D. Scott

  • Affiliations:

  • Trinity College, Cambridge CB2 1TQ, and Department of Mathematical Sciences, University of Memphis, Memphis TN38152;Department of Mathematics, University College London, Gower Street, London WC1E 6BT

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We prove results on partitioning graphs G with boundedmaximum degree. In particular, we provide optimal bounds forbipartitions V(G) = V1 ∪V2 in which we minimize{e(V1), e(V2)}.© 2004 Wiley Periodicals, Inc. J Graph Theory 46: 131143,2004