ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

p⩾n−1/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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.