On judicious partitions of hypergraphs with edges of size at most 3

DOI10.1016/J.EJC.2015.03.015MaRDI QIDQ2349971zbMATH OpenOpenAlexFDO

Authors Yao Zhang, Yu Cong Tang, Guiying Yan

Publication date 18 June 2015

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2015.03.015

zbMATH Keywords

bipartition

Mathematics Subject Classification ID

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

Recommendations

• Judicious partitioning of hypergraphs with edges of size at most 2
• On judicious partitions of uniform hypergraphs
• Judicious partitions of 3-uniform hypergraphs
• On several partitioning problems of Bollobás and Scott
• Partitioning 3-uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 637304 (Why is no real title available?)
• Judicious partitions and related problems
• Judicious partitions of 3-uniform hypergraphs
• Judicious partitions of hypergraphs
• Maximum cuts and judicious partitions in graphs without short cycles
• On several partitioning problems of Bollobás and Scott
• Probability Inequalities for Sums of Bounded Random Variables
• Problems and results on judicious partitions
• The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
• Weighted sums of certain dependent random variables

Cited in

(6)

• Judicious partitions of weighted hypergraphs
• The Bollobás-Scott conjecture for 4-uniform hypergraphs
• Bounds for the number of meeting edges in graph partitioning.
• Judicious partitioning of hypergraphs with edges of size at most 2
• Graph partitioning: an updated survey
• Defective coloring of hypergraphs

This page was built for publication: On judicious partitions of hypergraphs with edges of size at most 3

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