Max \(k\)-cut and judicious \(k\)-partitions
type: Item
instance of: scholarly article
title: Max \(k\)-cut and judicious \(k\)-partitions
zbMATH Open document ID: 1227.05171
author: Béla Bollobás
author: Alex Scott
published in: Discrete Mathematics
publication date: 2010-07-07T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5731706
zbMATH Keywords: max cut
zbMATH Keywords: judicious partitions
zbMATH Keywords: extremal graph theory
MaRDI profile type: Publication
full work available at URL: j.disc.2010.04.004
OpenAlex ID: W2022851630
cites work: Maximum cuts and judicious partitions in graphs without short cycles
cites work: Bipartite subgraphs
cites work: Bipartite subgraphs of integer weighted graphs
cites work: Problems and results on judicious partitions
cites work: Q4550236
cites work: Judicious partitions of 3-uniform hypergraphs
cites work: Exact bounds for judicious partitions of graphs
cites work: Judicious partitions of hypergraphs
cites work: Judicious partitions of graphs
cites work: Q4090369
cites work: Some Extremal Properties of Bipartite Subgraphs
cites work: Q4552255
cites work: Q4304346
cites work: On a bottleneck bipartition conjecture of Erdős
cites work: Graph partitions. II
cites work: Q3416246
DOI: 10.1016/J.DISC.2010.04.004
description: scientific article; zbMATH DE number 5731706