Problems and results on judicious partitions

被引：87

作者：

Bollobás, B ^{[1
]}

Scott, AD

机构：

[1] Univ Cambridge Trinity Coll, Cambridge CB2 1TQ, England

[2] Univ Memphis, Dept Math Sci, Memphis, TN 38152 USA

[3] UCL, Dept Math, London WC1E 6BT, England

来源：

RANDOM STRUCTURES & ALGORITHMS | 2002年 / 21卷 / 3-4期

关键词：

D O I：

10.1002/rsa.10062

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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. (C) 2002 Wiley Periodicals, Inc.

引用

页码：414 / 430

页数：17

共 46 条

[1] AHARONI R, 1990, J COMBINAT THEORY B, V50, P259
[2] Bipartite subgraphs of integer weighted graphs
Alon, N
Halperin, E
[J]. DISCRETE MATHEMATICS, 1998, 181 (1-3) : 19 - 29
[3] Bipartite subgraphs
Alon, N
[J]. COMBINATORICA, 1996, 16 (03) : 301 - 311
[4] ALON N, IN PRESS MAXIMUM CUT
[5] Azuma K., 1967, TOHOKU MATH J, V19, P357, DOI DOI 10.2748/TMJ/1178243286
[6] BECK J, 1995, HDB COMBINATORICS, V2, P1405
[7] ON A THEOREM ABOUT VERTEX COLORINGS OF GRAPHS
BERNARDI, C
[J]. DISCRETE MATHEMATICS, 1987, 64 (01) : 95 - 96
[8] Judicious partitions of hypergraphs
Bollobas, B
Scott, AD
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1997, 78 (01) : 15 - 31
[9] Exact bounds for judicious partitions of graphs
Bollobás, B
Scott, AD
[J]. COMBINATORICA, 1999, 19 (04) : 473 - 486
[10] Judicious partitions of 3-uniform hypergraphs
Bollobás, B
Scott, AD
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 2000, 21 (03) : 289 - 300

← 1 2 3 4 5 →