Judicious partitions of 3-uniform hypergraphs
From MaRDI portal
Publication:1972352
DOI10.1006/eujc.1998.0266zbMath0943.05058OpenAlexW2050977427MaRDI QIDQ1972352
Béla Bollobás, Alexander D. Scott
Publication date: 26 April 2000
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1998.0266
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (21)
Judicious bisection of hypergraphs ⋮ Judicious partitions of weighted hypergraphs ⋮ Problems and results on judicious partitions ⋮ Judicious partitions of directed graphs ⋮ On several partitioning problems of Bollobás and Scott ⋮ Graph partitioning: an updated survey ⋮ 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 ⋮ Bisections of graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs ⋮ Judicious partitions of uniform hypergraphs ⋮ Bounds for pairs in partitions of graphs ⋮ Max \(k\)-cut and judicious \(k\)-partitions ⋮ Partitioning 3-uniform hypergraphs ⋮ Judicious partitions of bounded‐degree graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ A mathematical approach on representation of competitions: competition cluster hypergraphs ⋮ On judicious partitions of hypergraphs with edges of size at most 3
Cites Work
- How to make a graph bipartite
- Some simplified NP-complete graph problems
- Judicious partitions of hypergraphs
- The size of the largest bipartite subgraphs
- Bipartite subgraphs
- Über die Approximation von Zahlen durch Reihen mit positiven Gliedern
- Some Extremal Properties of Bipartite Subgraphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Judicious partitions of 3-uniform hypergraphs
