Judicious partitions of hypergraphs

DOI10.1006/jcta.1996.2744zbMath0884.05066OpenAlexW2022684130MaRDI QIDQ1356017

Alexander D. Scott, Béla Bollobás

Publication date: 28 January 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1996.2744

zbMATH Keywords

3-uniform hypergraphvertex partition of hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (28)

On judicious partitions of uniform hypergraphs ⋮ Judicious bisection of hypergraphs ⋮ Problems and results on judicious partitions ⋮ On judicious bipartitions of directed graphs ⋮ On several partitioning problems of Bollobás and Scott ⋮ Bounds for pairs in judicious partitioning of graphs ⋮ On bisections of graphs without complete bipartite graphs ⋮ Graph partitioning: an updated survey ⋮ Bisections of Graphs Without Short Cycles ⋮ Partitioning dense uniform hypergraphs ⋮ Optimal bisections of directed graphs ⋮ The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs ⋮ Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 ⋮ Judiciously 3‐partitioning 3‐uniform hypergraphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs ⋮ Judicious partitions of 3-uniform hypergraphs ⋮ Judicious partitions of uniform hypergraphs ⋮ Bounds for pairs in partitions of graphs ⋮ Max \(k\)-cut and judicious \(k\)-partitions ⋮ Simple probabilistic analysis to generalize bottleneck graph multi-partitioning ⋮ Bipartitions of oriented graphs ⋮ A bound on judicious bipartitions of directed graphs ⋮ Partitioning 3-uniform hypergraphs ⋮ Judicious partitions of bounded‐degree graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ Erratum: The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs ⋮ On judicious partitions of hypergraphs with edges of size at most 3

Cites Work

• How to make a graph bipartite
• Global versus local asymptotic theories of finite-dimensional normed spaces
• Weighted sums of certain dependent random variables
• `` Strong NP-Completeness Results
• Probability Inequalities for Sums of Bounded Random Variables
• Über die Approximation von Zahlen durch Reihen mit positiven Gliedern
• Some Extremal Properties of Bipartite Subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Judicious partitions of hypergraphs