Max \(k\)-cut and judicious \(k\)-partitions
From MaRDI portal
Publication:982619
DOI10.1016/j.disc.2010.04.004zbMath1227.05171OpenAlexW2022851630MaRDI QIDQ982619
Béla Bollobás, Alexander D. Scott
Publication date: 7 July 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.04.004
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (16)
Biased partitions and judicious \(k\)-partitions of graphs ⋮ Maximum bisections of graphs without cycles of length 4 ⋮ Judicious partitions of directed graphs ⋮ On judicious bisections of graphs ⋮ Graph partitioning: an updated survey ⋮ Defective coloring of hypergraphs ⋮ The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs ⋮ Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Bisections of graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ Maximum bisections of graphs without short even cycles ⋮ On judicious bipartitions of graphs ⋮ On a Problem of Judiciousk-Partitions of Graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ Maximum bipartite subgraphs in graphs without short cycles
Cites Work
- On a bottleneck bipartition conjecture of Erdős
- Judicious partitions of graphs
- Judicious partitions of hypergraphs
- Bipartite subgraphs of integer weighted graphs
- Maximum cuts and judicious partitions in graphs without short cycles
- Judicious partitions of 3-uniform hypergraphs
- Exact bounds for judicious partitions of graphs
- Bipartite subgraphs
- Problems and results on judicious partitions
- Some Extremal Properties of Bipartite Subgraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Max \(k\)-cut and judicious \(k\)-partitions
