Even‐Degeneracy of a Random Graph

ABSTRACT A graph is even‐degenerate if one can iteratively remove a vertex of even degree at each step until at most one edge remains. Recently, Janzer and Yip showed that the Erdős–Rényi random graph is even‐degenerate with high probability, and asked whether an analogous result holds for any general . In this paper, we answer this question for any constant in affirmation by proving that is even‐degenerate with high probability.