Bounds for the number of meeting edges in graph partitioning

DOI10.21136/CMJ.2017.0147-16zbMath1488.05417OpenAlexW2736227478MaRDI QIDQ5355069

Qinghou Zeng, Jian-Feng Hou

Publication date: 6 September 2017

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21136/cmj.2017.0147-16

zbMATH Keywords

partitionjudicious partitionweighted hypergraph

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) Structural characterization of families of graphs (05C75) Signed and weighted graphs (05C22)

Related Items (1)

Biased partitions and judicious \(k\)-partitions of graphs

This page was built for publication: Bounds for the number of meeting edges in graph partitioning