Partitioning dense uniform hypergraphs

DOI10.1007/S10878-017-0153-XzbMath1386.05158OpenAlexW2730003069MaRDI QIDQ1698057

Shu-Fei Wu, Jian-Feng Hou

Publication date: 21 February 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0153-x

zbMATH Keywords

partitionAzuma-Hoeffding inequalitymax-cut

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Density (toughness, etc.) (05C42)

Related Items (1)

Graph partitioning: an updated survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On judicious partitions of uniform hypergraphs
• On judicious bisections of graphs
• A bound for judicious \(k\)-partitions of graphs
• On several partitioning problems of Bollobás and Scott
• Partitioning 3-uniform hypergraphs
• Judicious \(k\)-partitions of graphs
• Judicious partitions of hypergraphs
• On minimum balanced bipartitions of triangle-free graphs
• The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
• Weighted sums of certain dependent random variables
• Bounds for pairs in judicious partitioning of graphs
• Problems and results on judicious partitions
• Better Bounds for k-Partitions of Graphs
• Probability Inequalities for Sums of Bounded Random Variables
• Some Extremal Properties of Bipartite Subgraphs
• On judicious bipartitions of graphs

This page was built for publication: Partitioning dense uniform hypergraphs