On a bottleneck bipartition conjecture of Erdős

DOI10.1007/BF01285820zbMath0767.05059OpenAlexW2013914289WikidataQ122944139 ScholiaQ122944139MaRDI QIDQ1200279

T. D. Porter

Publication date: 17 January 1993

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01285820

zbMATH Keywords

minimaxdiscrepancybipartitionmax-cutconjecture of Erdős

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (19)

Judicious partitions of weighted hypergraphs ⋮ Problems and results on judicious partitions ⋮ On several partitioning problems of Bollobás and Scott ⋮ On judicious bisections of graphs ⋮ Graph partitioning: an updated survey ⋮ Maximum cuts and judicious partitions in graphs without short cycles ⋮ Optimal bisections of directed graphs ⋮ The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs ⋮ The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs ⋮ Judicious partitions of uniform hypergraphs ⋮ Bounds for judicious balanced bipartitions of graphs ⋮ A note on balanced bipartitions ⋮ Bounds for pairs in partitions of graphs ⋮ Max \(k\)-cut and judicious \(k\)-partitions ⋮ Simple probabilistic analysis to generalize bottleneck graph multi-partitioning ⋮ Balanced judicious bipartitions of graphs ⋮ Judicious \(k\)-partitions of graphs ⋮ On a Problem of Judiciousk-Partitions of Graphs ⋮ Judicious partitions of bounded‐degree graphs

This page was built for publication: On a bottleneck bipartition conjecture of Erdős