A note on judicious bisections of graphs

DOI10.1017/s000497272400008xMaRDI QIDQ6666591

Shu-Fei Wu, Xiaobei Xiong

Publication date: 20 January 2025

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

judicious partitionmax-cutbisection\(H\)-free

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Judicious partitions of weighted hypergraphs
• On judicious bisections of graphs
• Bisections of graphs
• A note on balanced bipartitions
• On tight components and anti-tight components
• Judicious partitions of hypergraphs
• Exact bounds for judicious partitions of graphs
• Judicious partitions of bounded‐degree graphs
• Bisections of Graphs Without Short Cycles
• Problems and results on judicious partitions
• Balanced judicious bipartitions of graphs
• Some Extremal Properties of Bipartite Subgraphs
• On bisections of graphs without complete bipartite graphs
• Graph partitioning: an updated survey

This page was built for publication: A note on judicious bisections of graphs