2 problems

For $q\in[0,1]$, call a graph $J$ $q$-sparse if … where $\mathbb{E}_qX_I$ is the expected number of copies of $I$ in $G_{n,q}$. Sparse-graph reformulation. There is a fixed $K$ suc…

Develin–Hartke conjecture. There exists an outbreak on $\mathbb{L}^d$ that cannot be contained by deploying $f(t)$ firefighters at time $t$.