This naturally raises the question: can one improve this bound if G is far from being a disjoint union of cliques?
Statement
This naturally raises the question: can one improve this bound if G is far from being a disjoint union of cliques? Neverthe- less, the conjecture of Alon, Bollobás, Krivelevich and Sudakov remains wide open. For many years, it was a tantalizing open problem to find any absolute constant \varepsilon > 0, independent of r, such that every Kr -free graph has surplus Ωr (m1/2+\varepsilon ). MaxCut in H-free graphs: recent results and connections Aleksa Milojević (joint work with Zhihan Jin, István Tomon, Shengtong Zhang)
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.