DeMarco–Kahn upper tail conjecture for strictly balanced graphs and dense regimes

Let HH be a graph, let mHm_H 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 HH 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 HH. Moreover, for every fixed γ>0\gamma>0, it is true under the additional assumption

pn1/mH+γ.p\geqslant n^{-1/m_H+\gamma}.

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.

Sources & referencesView supporting material

Primary source

Matas Šileikis and Lutz Warnke, “A counterexample to the DeMarco-Kahn Upper Tail Conjecture”, arXiv:1809.09595 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.