Partitioning 3-uniform hypergraphs

DOI10.1016/J.JCTB.2011.07.001zbMath1237.05143OpenAlexW2011488679MaRDI QIDQ765201

Jie Ma, Xingxing Yu

Publication date: 19 March 2012

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2011.07.001

zbMATH Keywords

Azuma-Hoeffding inequalityjudicious partition3-uniform hypergraph

Mathematics Subject Classification ID

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

Related Items (12)

On judicious partitions of uniform hypergraphs ⋮ Judicious partitions of directed graphs ⋮ Partitioning digraphs with outdegree at least 4 ⋮ Graph partitioning: an updated survey ⋮ 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 ⋮ Bisections of graphs ⋮ Simple probabilistic analysis to generalize bottleneck graph multi-partitioning ⋮ Bipartitions of oriented graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Judicious partitions of uniform hypergraphs
• On several partitioning problems of Bollobás and Scott
• Judicious partitions of hypergraphs
• Maximum cuts and judicious partitions in graphs without short cycles
• Judicious partitions of 3-uniform hypergraphs
• Weighted sums of certain dependent random variables
• Problems and results on judicious partitions
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: Partitioning 3-uniform hypergraphs