MaxCut in graphs with sparse neighborhoods
Jinghua Deng, Jianfeng Hou, Siwei Lin, Qinghou Zeng

TL;DR
This paper establishes new lower bounds on the surplus of MaxCut in graphs with sparse neighborhoods, extending previous results and supporting conjectures about surplus in H-free graphs.
Contribution
It introduces a stronger, more general bound on MaxCut surplus for graphs with sparse neighborhoods, unifying and extending prior bounds for various H-free graphs.
Findings
Derived new bounds for surplus in triangle-free and bipartite-free graphs.
Extended results to graphs with a vertex whose removal makes them bipartite.
Provided evidence supporting conjectures on surplus growth in H-free graphs.
Abstract
Let be a graph with edges and let denote the size of a largest cut of . The difference is called the surplus of . A fundamental problem in MaxCut is to determine for without specific structure, and the degree sequence of plays a key role in getting lower bounds of . A classical example, given by Shearer, is that for triangle-free graphs , implying that . It was extended to graphs with sparse neighborhoods by Alon, Krivelevich and Sudakov. In this paper, we establish a novel and stronger result for a more general family of graphs with sparse neighborhoods. Our result can derive many well-known bounds on surplus of -free graphs for different , such as triangles, even cycles,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Graph theory and applications
