EUVIMEDEUVIMED entdecken
Crossref

Even‐Degeneracy of a Random Graph

Ting‐Wei Chao, Dingding Dong, Zixuan Xu

Random Structures & Algorithms · 2026-05 · 68 (3)

DOI: 10.1002/rsa.70064 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 13.04.2026. Verfasst von Ting‐Wei Chao und 2 weiteren Autor:innen. Die Arbeit nennt 4 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Chao, T., Dong, D., & Xu, Z. (2026). Even‐Degeneracy of a Random Graph. Random Structures & Algorithms, 68(3). https://doi.org/10.1002/rsa.70064

Vancouver

Chao T, Dong D, Xu Z. Even‐Degeneracy of a Random Graph. Random Structures & Algorithms. 2026;68(3). doi:10.1002/rsa.70064

BibTeX
@article{Chao2026,
  author = {Chao, Ting‐Wei and Dong, Dingding and Xu, Zixuan},
  title = {Even‐Degeneracy of a Random Graph},
  journal = {Random Structures & Algorithms},
  year = {2026},
  volume = {68},
  number = {3},
  doi = {10.1002/rsa.70064}
}
Kostenlos starten →