Max-Bisections of graphs without even cycles
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912492259639296 |
|---|---|
| author | Hou, Jianfeng Lin, Siwei Zeng, Qinghou |
| author_facet | Hou, Jianfeng Lin, Siwei Zeng, Qinghou |
| contents | For an integer $k\ge 2$, let $G$ be a graph with $m$ edges and without cycles of length $2k$. The pivotal Alon-Krivelevich-Sudakov Theorem on Max-Cuts states that $G$ has a bipartite subgraph with at least $m/2+Ω(m^{(2k+1)/(2k+2)})$ edges. In this paper, we present a bisection variant of it by showing that if $G$ has minimum degree at least $k$, then $G$ has a balanced bipartite subgraph with at least $m/2+Ω(m^{(2k+1)/(2k+2)})$ edges. It not only answers a problem of Fan, Hou and Yu in full generality but also enhances a recent result given by Hou, Wu and Zhong.
Our approach hinges on a key bound for bisections of graphs with sparse neighborhoods concerning the degree sequence. The result is inspired by the celebrated approximation algorithm of Goemans and Williamson and appears to be worthy of future exploration. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_21694 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Max-Bisections of graphs without even cycles Hou, Jianfeng Lin, Siwei Zeng, Qinghou Combinatorics For an integer $k\ge 2$, let $G$ be a graph with $m$ edges and without cycles of length $2k$. The pivotal Alon-Krivelevich-Sudakov Theorem on Max-Cuts states that $G$ has a bipartite subgraph with at least $m/2+Ω(m^{(2k+1)/(2k+2)})$ edges. In this paper, we present a bisection variant of it by showing that if $G$ has minimum degree at least $k$, then $G$ has a balanced bipartite subgraph with at least $m/2+Ω(m^{(2k+1)/(2k+2)})$ edges. It not only answers a problem of Fan, Hou and Yu in full generality but also enhances a recent result given by Hou, Wu and Zhong. Our approach hinges on a key bound for bisections of graphs with sparse neighborhoods concerning the degree sequence. The result is inspired by the celebrated approximation algorithm of Goemans and Williamson and appears to be worthy of future exploration. |
| title | Max-Bisections of graphs without even cycles |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2505.21694 |