Bounds for pairs in partitions of graphs

DOI10.1016/j.disc.2010.03.023zbMath1219.05143OpenAlexW2067505988MaRDI QIDQ982612

Xingxing Yu, Jie Ma

Publication date: 7 July 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.023

zbMATH Keywords

Azuma-Hoeffding inequalityjudicious partitiongraph partition

Mathematics Subject Classification ID

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

Related Items

On judicious bipartitions of directed graphs ⋮ Bounds for pairs in judicious partitioning of graphs ⋮ On bisections of graphs without complete bipartite graphs ⋮ Graph partitioning: an updated survey ⋮ Maximum cuts in \(\mathscr{H} \)-free graphs ⋮ Simple probabilistic analysis to generalize bottleneck graph multi-partitioning ⋮ Bipartitions of oriented graphs

Cites Work

• On a bottleneck bipartition conjecture of Erdős
• Judicious partitions of hypergraphs
• Maximum cuts and judicious partitions in graphs without short cycles
• Judicious partitions of 3-uniform hypergraphs
• Exact bounds for judicious partitions of graphs
• Weighted sums of certain dependent random variables
• Problems and results on judicious partitions
• Probability Inequalities for Sums of Bounded Random Variables
• Some Extremal Properties of Bipartite Subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item