ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For q∈[0,1]q\in[0,1], call a graph JJ qq-sparse if

EqXI≥1∀I⊆J,\mathbb{E}_qX_I\geq 1\quad\forall I\subseteq J,

where EqXI\mathbb{E}_qX_I is the expected number of copies of II in Gn,qG_{n,q}. Sparse-graph reformulation. There is a fixed KK such that if HH is qq-sparse and p=Kqp=Kq, then

N(H,F)<EpXF∀F⊂H.N(H,F)<\mathbb{E}_pX_F\quad\forall F\subset H.

This is stated as an appealing restatement of the fractional expectation threshold conjecture, with the harmless convention change from threshold 1/21/2 to 11 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 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.