The sparse-graph reformulation of the fractional expectation threshold conjecture
Statement
For , call a graph -sparse if
where is the expected number of copies of in . Sparse-graph reformulation. There is a fixed such that if is -sparse and , then
This is stated as an appealing restatement of the fractional expectation threshold conjecture, with the harmless convention change from threshold to noted in the source. It is therefore open together with that conjecture.
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.