Partitioning 3-uniform hypergraphs
From MaRDI portal
Publication:765201
DOI10.1016/j.jctb.2011.07.001zbMath1237.05143MaRDI QIDQ765201
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
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs, Judiciously 3‐partitioning 3‐uniform hypergraphs, Judicious Partitioning of Hypergraphs with Edges of Size at Most 2, Partitioning digraphs with outdegree at least 4, Graph partitioning: an updated survey, Optimal bisections of directed graphs, On judicious partitions of uniform hypergraphs, Bisections of graphs, Simple probabilistic analysis to generalize bottleneck graph multi-partitioning, Bipartitions of oriented graphs, Partitioning dense uniform hypergraphs, Judicious partitions of directed 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