Second Kahn–Kalai conjecture
Statement
There exists a universal constant such that, for every finite graph , the fractional expectation threshold for containing satisfies , where is the expectation threshold defined by the condition that the expected number of copies of is at least .
Record
- Added
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.