| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777380 | European Journal of Combinatorics | 2017 | 15 Pages |
Abstract
If the underlying graph of D does not contain cycles of length 4, then we show that D admits a bisection V(D)=V1âªV2 such that min{e(V1,V2),e(V2,V1)}â¥(1/4+o(1))m.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jianfeng Hou, Shufei Wu, Guiying Yan,