Conlon–Fox–Kwan–Sudakov conjecture on surplus in hypergraph cuts
Statement
Let and be integers satisfying
Let be an -graph with edges.
Conlon–Fox–Kwan–Sudakov conjecture. The surplus should satisfy
This would establish the conjectured -order improvement for -cuts in -graphs. The paper identifies this as an open problem, excluding the pair .
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.