Sciweavers

DM
1998
62views more  DM 1998»
13 years 4 months ago
Bipartite subgraphs of integer weighted graphs
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large...
Noga Alon, Eran Halperin