Alon–Krivelevich–Sudakov surplus order-of-magnitude conjecture
Alon–Krivelevich–Sudakov surplus order-of-magnitude conjecture
Let be a graph with edges, and let denote its surplus, where is the number of edges in a largest bipartite subgraph of . For a fixed graph , let be the smallest value of over all -free graphs with edges. Alon–Krivelevich–Sudakov conjecture. For any fixed graph , there is a constant such that
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.