Alon–Krivelevich–Sudakov surplus order-of-magnitude conjecture

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–Krivelevich–Sudakov conjecture. For any fixed graph HH, there is a constant c(H)>0c(H)>0 such that

sp(m,H)=Θ(mc(H)).\mathrm{sp}(m,H)=\Theta(m^{c(H)}).

This conjecture seeks the precise order of the surplus for every fixed forbidden graph, strengthening the problem of obtaining a universal lower-bound exponent. The paper presents it as a more difficult conjecture and does not report a resolution.

Sources & referencesView supporting material

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.