Problems and results on judicious partitions

Authors:
B. Bollobás;A. D. Scott
Affiliations:
Trinity College, Cambridge CB2 1TQ, United Kingdom and Department of Mathematical Sciences, University of Memphis, Memphis, TN;Department of Mathematics, University College London, Gower Street, London WC1E 6BT, United Kingdom
Venue:
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Year:
2002

Citing 10
Cited 10

How to make a graph bipartite

Journal of Combinatorial Theory Series A
Unfriendly partitions of a graph

Journal of Combinatorial Theory Series B
Bipartite Subgraphs of Triangle-Free Graphs

SIAM Journal on Discrete Mathematics
.879-approximation algorithms for MAX CUT and MAX 2SAT

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Discrepancy theory

Handbook of combinatorics (vol. 2)
Some optimal inapproximability results

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Judicious partitions of hypergraphs

Journal of Combinatorial Theory Series A
Bipartite subgraphs of integer weighted graphs

Discrete Mathematics
Maximum cuts: improvements and local algorithmic analogues of the Edwards-Erdös inequality

Discrete Mathematics
Judicious partitions of 3-uniform hypergraphs

European Journal of Combinatorics

Edge Distribution of Graphs with Few Copies of a Given Graph

Combinatorics, Probability and Computing
Maximizing Several Cuts Simultaneously

Combinatorics, Probability and Computing
Triangle-free subcubic graphs with minimum bipartite density

Journal of Combinatorial Theory Series B
Judicious k-partitions of graphs

Journal of Combinatorial Theory Series B
Bipartite density of triangle-free subcubic graphs

Discrete Applied Mathematics
On several partitioning problems of Bollobás and Scott

Journal of Combinatorial Theory Series B
Partitioning 3-uniform hypergraphs

Journal of Combinatorial Theory Series B
Bisections of graphs

Journal of Combinatorial Theory Series B
Random partitions and edge-disjoint Hamiltonian cycles

Journal of Combinatorial Theory Series B
On minimum balanced bipartitions of triangle-free graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a few results and a larger number of questions concerning partitions of graphs or hypergraphs, where the objective is to maximize or minimize several quantities simultaneously. We consider a variety of extremal problems; many of these also have algorithmic counterparts.