Alon–Bollobás–Krivelevich–Sudakov surplus conjecture for H-free graphs
Alon–Bollobás–Krivelevich–Sudakov surplus conjecture for H-free graphs
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–Bollobás–Krivelevich–Sudakov conjecture. For any fixed graph , there is a constant such that
The conjecture predicts a uniform improvement over the general surplus bound for every fixed forbidden graph . It remains open; the best known lower bounds establish weaker exponents for particular families of .
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.