Partitioning 3-uniform hypergraphs

DOI10.1016/J.JCTB.2011.07.001zbMATH Open1237.05143OpenAlexW2011488679MaRDI QIDQ765201FDOQ765201

Authors: 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

Recommendations

• The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
• Judicious partitions of 3-uniform hypergraphs
• Judiciously 3-partitioning 3-uniform hypergraphs
• On judicious partitions of uniform hypergraphs
• Partitioning dense uniform hypergraphs

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)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• Judicious partitions of hypergraphs
• Maximum cuts and judicious partitions in graphs without short cycles
• Weighted sums of certain dependent random variables
• Judicious partitions and related problems
• Problems and results on judicious partitions
• Judicious partitions of uniform hypergraphs
• On several partitioning problems of Bollobás and Scott
• Title not available (Why is that?)
• Judicious partitions of 3-uniform hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (17)

• On judicious partitions of uniform hypergraphs
• Bisections of graphs
• Judicious partitions of uniform hypergraphs
• Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
• Graph partitioning: an updated survey
• On judicious partitions of hypergraphs with edges of size at most 3
• Bipartitions of oriented graphs
• The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
• Optimal bisections of directed graphs
• Judicious partitioning of hypergraphs with edges of size at most 2
• Partitioning digraphs with outdegree at least 4
• Judiciously 3-partitioning 3-uniform hypergraphs
• The Bollobás-Scott conjecture for 4-uniform hypergraphs
• Three Partition Refinement Algorithms
• Partitioning dense uniform hypergraphs
• Judicious partitions of directed graphs
• Uniform partitions of 3-space, their relatives and embedding

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765201)