A note on judicious partition of hypergraphs

DOI10.1016/J.DISC.2026.115349MaRDI QIDQ7409369zbMATH OpenFDO

Authors Qiming Hu, Baogang Xu

Publication date 2027

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115349

zbMATH Keywords

bipartitionbisectionhypergraphjudicious partition

Mathematics Subject Classification ID

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

Cites work

• A bound for judicious k-partitions of graphs
• A note on balanced bipartitions
• Bounds for pairs in partitions of graphs
• Cutting two graphs simultaneously
• Exact bounds for judicious partitions of graphs
• scientific article; zbMATH DE number 3510345 (Why is no real title available?)
• scientific article; zbMATH DE number 637304 (Why is no real title available?)
• Hypergraph cuts above the average
• Judicious \(k\)-partitions of graphs
• Judicious bisection of hypergraphs
• Judicious partitions of bounded‐degree graphs
• Judiciously 3-partitioning 3-uniform hypergraphs
• Max \(k\)-cut and judicious \(k\)-partitions
• Maximizing Several Cuts Simultaneously
• On a bottleneck bipartition conjecture of Erdős
• On several partitioning problems of Bollobás and Scott
• Problems and results on judicious partitions
• Some Extremal Properties of Bipartite Subgraphs

This page was built for publication: A note on judicious partition of hypergraphs

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