Answers are grounded in this paper and cite their sources.
A graph is even-degenerate if we can order its vertices as v₁,,vₙ so that the number of edges from vᵢ to v₁,,vᵢ₋₁ is even for all $i>2$. We show that the probability $G(n,p)$ is even-degenerate is e-Ω(n/loglog n), which is only a factor of loglog n away, in the exponent, from the trivial lower bound 2-O(n).
No takes yet. Share an insight, caveat, or question.
Chao et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: