Judicious partitions of uniform hypergraphs

DOI10.1007/S00493-014-2916-7zbMath1340.05196arXiv0911.0563OpenAlexW1971692513MaRDI QIDQ484549

John Haslegrave

Publication date: 7 January 2015

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.0563

zbMATH Keywords

partitionsuniform hypergraphs

Mathematics Subject Classification ID

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

Related Items (11)

On judicious partitions of uniform hypergraphs ⋮ Graph partitioning: an updated survey ⋮ Optimal bisections of directed graphs ⋮ Defective coloring of hypergraphs ⋮ The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs ⋮ Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs ⋮ On a Problem of Judiciousk-Partitions of Graphs ⋮ Partitioning 3-uniform hypergraphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a bottleneck bipartition conjecture of Erdős
• Judicious partitions of graphs
• Judicious partitions of hypergraphs
• Bipartite subgraphs of integer weighted graphs
• Judicious partitions of 3-uniform hypergraphs
• Exact bounds for judicious partitions of graphs
• The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
• Problems and results on judicious partitions

This page was built for publication: Judicious partitions of uniform hypergraphs