Alon–Bollobás–Krivelevich–Sudakov surplus conjecture for H-free graphs

About 3 years old · traced to

Let GG be a graph with mm edges, and let sp(G)=mc(G)−m/2\mathrm{sp}(G)=\mathrm{mc}(G)-m/2 denote its surplus, where mc(G)\mathrm{mc}(G) is the number of edges in a largest bipartite subgraph of GG. For a fixed graph HH, let sp(m,H)\mathrm{sp}(m,H) be the smallest value of sp(G)\mathrm{sp}(G) over all HH-free graphs GG with mm edges. Alon–Bollobás–Krivelevich–Sudakov conjecture. For any fixed graph HH, there is a constant ϵ(H)>0\epsilon(H)>0 such that

sp(m,H)=Ω(m3/4+ϵ(H)).\mathrm{sp}(m,H)=\Omega(m^{3/4+\epsilon(H)}).

The conjecture predicts a uniform improvement over the general Ω(m)\Omega(\sqrt m) surplus bound for every fixed forbidden graph HH. It remains open; the best known lower bounds establish weaker exponents for particular families of HH.

References

Primary source

Jinghua Deng, Jianfeng Hou, Siwei Lin and Qinghou Zeng, “MaxCut in graphs with sparse neighborhoods”, arXiv:2307.09309 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.