Year: 2026
Type: article
Abstract: 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.
Source: Random Structures and Algorithms
DOI: 10.1002/rsa.70064
Authors: Ting‐Wei Chao, Dingding Dong, Zixuan Xu
Institutions: Massachusetts Institute of Technology, Harvard University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4414894485
FWCI:
Cites:
Cited by:
Related to: