Beyond the MaxCut problem in $H$-free graphs

Abstract

In a recent breakthrough, Zhang proves that if $G$ is an $H$-free graph with $m$ edges, then $G$ has a cut of size at least $m/2+c_Hm^{0.5001}$, making a significant step towards a well known conjecture of Alon, Bollobás, Krivelevich and Sudakov. We show that the methods of Zhang can be further boosted, and prove the following strengthening. If $G$ is a graph with $m$ edges and no clique of size $m^{1/2-δ}$, then $G$ has a cut of size at least $m/2+m^{1/2+\varepsilon}$ for some $\varepsilon=\varepsilon(δ)>0$. In addition, we sharpen another result of Zhang by proving that if $G$ is an $n$-vertex $m$-edge graph with MaxCut of size at most $m/2+n^{1+\varepsilon}$ (or its smallest eigenvalue $λ_n$ satisfies $|λ_n|\leq n^{\varepsilon}$), then $G$ is $n^{-\varepsilon}$-close to the disjoint union of cliques for some absolute constant $\varepsilon>0$.