Judicious Partitioning of Hypergraphs with Edges of Size at Most 2

DOI10.1017/S0963548316000274zbMath1371.05229OpenAlexW2510161366MaRDI QIDQ5366944

Qinghou Zeng, Jian-Feng 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) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (9)

Biased partitions and judicious \(k\)-partitions of graphs ⋮ Graph partitioning: an updated survey ⋮ Bisections of Graphs Without Short Cycles ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Maximum bisections of graphs without short even cycles ⋮ Bisections of graphs without \(K_{2, l}\) ⋮ Bipartitions of oriented graphs ⋮ On partitions of \(K_{2, 3}\)-free graphs under degree constraints ⋮ On a Problem of Judiciousk-Partitions of Graphs

Cites Work

• Unnamed Item
• On judicious partitions of uniform hypergraphs
• On judicious bisections of graphs
• Bisections of graphs
• A bound for judicious \(k\)-partitions of graphs
• Judicious partitions of uniform hypergraphs
• On several partitioning problems of Bollobás and Scott
• Partitioning 3-uniform hypergraphs
• Max \(k\)-cut and judicious \(k\)-partitions
• Bipartite density of triangle-free subcubic graphs
• 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
• The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
• Triangle-free subcubic graphs with minimum bipartite density
• Bipartite subgraphs
• Problems and results on judicious partitions
• Some Extremal Properties of Bipartite Subgraphs

This page was built for publication: Judicious Partitioning of Hypergraphs with Edges of Size at Most 2