A nearly tight bound on the probability $G(n,p)$ is even-degenerate

Ting-Wei Chao, Bruce Reed

A graph is even-degenerate if we can order its vertices as $v_1,\dots ,v_n$ so that the number of edges from $v_i$ to $v_1,\dots ,v_{i-1}$ is even for all $i>2$. We show that the pro…