Judicious partitions of graphs

DOI10.1007/BF01876314zbMath0796.05056OpenAlexW2019647121MaRDI QIDQ1314903

Béla Bollobás, Alexander D. Scott

Publication date: 5 September 1994

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

partitionsboundpartitions of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal combinatorics (05D99)

Related Items (11)

Space Crossing Numbers ⋮ Judicious partitions of weighted hypergraphs ⋮ Problems and results on judicious partitions ⋮ Upper bounds on minimum balanced bipartitions ⋮ Judiciously 3‐partitioning 3‐uniform hypergraphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ Judicious partitions of uniform hypergraphs ⋮ A note on balanced bipartitions ⋮ Max \(k\)-cut and judicious \(k\)-partitions ⋮ On judicious bipartitions of graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable

Cites Work

• On a theorem about vertex colorings of graphs
• Unfriendly partitions of a graph
• How to make a graph bipartite
• A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• Weighted sums of certain dependent random variables
• A note on bipartite subgraphs of triangle‐free graphs
• Probability Inequalities for Sums of Bounded Random Variables
• Some Extremal Properties of Bipartite Subgraphs

This page was built for publication: Judicious partitions of graphs