2 papers
math.CO2026
Sharp Bisection Bounds for Digraphs
Zhaoyang Ma, Shufei Wu, Qinghou Zeng
Fix an integer . We prove that, for all sufficiently large , every digraph with arcs and minimum semidegree at least admits a bisection wit…
math.CO2024
Max-Bisections of graphs without perfect matching
Jianfeng Hou, Shufei Wu, Yuanyuan Zhong
A bisection of a graph is a bipartition of its vertex set such that the two resulting parts differ in size by at most 1, and its size is the number of edges that connect vertices i…