Alon–Krivelevich–Sudakov surplus order-of-magnitude conjecture
Statement
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.
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.