Partitioning dense uniform hypergraphs
type: Item
instance of: scholarly article
title: Partitioning dense uniform hypergraphs
zbMATH Open document ID: 1386.05158
author: Shu-Fei Wu
author: Jianfeng Hou
published in: Journal of Combinatorial Optimization
publication date: 2018-02-21T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C42
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 6841559
zbMATH Keywords: partition
zbMATH Keywords: max-cut
zbMATH Keywords: Azuma-Hoeffding inequality
MaRDI profile type: Publication
full work available at URL: s10878-017-0153-x
OpenAlex ID: W2730003069
cites work: Weighted sums of certain dependent random variables
cites work: Q5422499
cites work: Judicious partitions of hypergraphs
cites work: Problems and results on judicious partitions
cites work: Some Extremal Properties of Bipartite Subgraphs
cites work: Bounds for pairs in judicious partitioning of graphs
cites work: A bound for judicious \(k\)-partitions of graphs
cites work: The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: On judicious partitions of uniform hypergraphs
cites work: Q4519896
cites work: On minimum balanced bipartitions of triangle-free graphs
cites work: On several partitioning problems of Bollobás and Scott
cites work: Partitioning 3-uniform hypergraphs
cites work: On judicious bipartitions of graphs
cites work: Graph partitions: recent progresses and some open problems
cites work: Judicious \(k\)-partitions of graphs
cites work: Better Bounds for k-Partitions of Graphs
cites work: On judicious bisections of graphs
DOI: 10.1007/S10878-017-0153-X
description: scientific article; zbMATH DE number 6841559