当前位置: X-MOL 学术SIAM J. Discret. Math. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming
SIAM Journal on Discrete Mathematics ( IF 0.9 ) Pub Date : 2021-07-09 , DOI: 10.1137/20m1333985
Charles Carlson , Alexandra Kolla , Ray Li , Nitya Mani , Benny Sudakov , Luca Trevisan

SIAM Journal on Discrete Mathematics, Volume 35, Issue 3, Page 1557-1568, January 2021.
For a graph $G$, let $f(G)$ denote the size of the maximum cut in $G$. The problem of estimating $f(G)$ as a function of the number of vertices and edges of $G$ has a long history and was extensively studied in the last fifty years. In this paper we propose an approach, based on semidefinite programming, to prove lower bounds on $f(G)$. We use this approach to find large cuts in graphs with few triangles and in $K_r$-free graphs.


中文翻译:

通过半定规划在 $H$-Free 图中的 Max-Cut 下界

SIAM Journal on Discrete Mathematics,第 35 卷,第 3 期,第 1557-1568 页,2021 年 1 月。
对于图形 $G$,让 $f(G)$ 表示以 $G$ 为单位的最大削减的大小。将 $f(G)$ 估计为 $G$ 的顶点和边数的函数的问题有着悠久的历史,并且在过去的五十年中得到了广泛的研究。在本文中,我们提出了一种基于半定规划的方法来证明 $f(G)$ 的下界。我们使用这种方法在具有很少三角形的图中和无 $K_r$ 的图中找到大的切割。
更新日期:2021-07-09
down
wechat
bug