Judicious partitioning of hypergraphs with edges of size at most 2

DOI10.1017/S0963548316000274MaRDI QIDQ5366944zbMATH OpenOpenAlexFDO

Authors Qinghou Zeng, Jianfeng Hou

Publication date 10 October 2017

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548316000274

zbMATH Keywords

extremal graph theorymax cutjudicious partitions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• On several partitioning problems of Bollobás and Scott
• On judicious partitions of hypergraphs with edges of size at most 3
• On judicious partitions of uniform hypergraphs
• Judicious bisection of hypergraphs
• Problems and results on judicious partitions

Cites work

• A bound for judicious \(k\)-partitions of graphs
• Bipartite density of triangle-free subcubic graphs
• Bipartite subgraphs
• Bisections of graphs
• Exact bounds for judicious partitions of graphs
• Judicious partitions and related problems
• Judicious partitions of 3-uniform hypergraphs
• Judicious partitions of hypergraphs
• Judicious partitions of uniform hypergraphs
• Max \(k\)-cut and judicious \(k\)-partitions
• Maximum cuts and judicious partitions in graphs without short cycles
• On judicious bisections of graphs
• On judicious partitions of uniform hypergraphs
• On several partitioning problems of Bollobás and Scott
• Partitioning 3-uniform hypergraphs
• Problems and results on judicious partitions
• Some Extremal Properties of Bipartite Subgraphs
• The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
• Triangle-free subcubic graphs with minimum bipartite density

Cited in

(15)

• Maximum bisections of graphs without short even cycles
• Bounds for the number of meeting edges in graph partitioning.
• Bisections of graphs without \(K_{2, l}\)
• Judicious partitions of weighted hypergraphs
• Bounds for \(l\)-tuples in judicious partition of hypergraphs and graphs
• Biased partitions and judicious \(k\)-partitions of graphs
• On judicious partitions of hypergraphs with edges of size at most 3
• Bipartitions of oriented graphs
• Graph partitioning: an updated survey
• Maximum cuts of graphs with forbidden cycles
• On several partitioning problems of Bollobás and Scott
• Bisections of graphs without short cycles
• On partitions of \(K_{2, 3}\)-free graphs under degree constraints
• An efficient algorithm for judicious partition of hypergraphs
• On a problem of judicious \(k\)-partitions of graphs

This page was built for publication: Judicious partitioning of hypergraphs with edges of size at most 2

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