DeMarco–Kahn upper tail conjecture for strictly balanced graphs and dense regimes
Statement
Let be a graph, let denote its appearance-threshold parameter, and let the DeMarco–Kahn upper tail conjecture be the assertion that the upper-tail estimate stated above holds. A graph is strictly balanced when the relevant density parameter is strictly maximized by rather than by a proper subgraph. DeMarco–Kahn's restricted upper tail conjecture. The DeMarco–Kahn upper tail conjecture is true for every strictly balanced graph . Moreover, for every fixed , it is true under the additional assumption
These are proposed restricted regimes in which the false general conjecture may still hold. The paper presents them as open problems rather than proving them.
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.