EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Cycle Lengths in the Percolated Hypercube

Michael Anastos, Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich, Lyuben Lichev

Random Structures & Algorithms · 2026-12 · 69 (4)

DOI: 10.1002/rsa.70108 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 15.11.2026. Verfasst von Michael Anastos und 5 weiteren Autor:innen. Die Arbeit nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Austrian Science Fund, United States-Israel Binational Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let be the random subgraph of the ‐dimensional binary hypercube obtained after edge‐percolation with probability . It was shown recently by the authors that, for every , there is some such that, if , then typically contains a cycle of length at least . We strengthen this result to show that, under the same assumptions, typically contains cycles of all even lengths between four and .

Förderung

  • Austrian Science Fund
  • United States-Israel Binational Science Foundation

Zitieren

APA

Anastos, M., Diskin, S., Erde, J., Kang, M., Krivelevich, M., & Lichev, L. (2026). Cycle Lengths in the Percolated Hypercube. Random Structures & Algorithms, 69(4). https://doi.org/10.1002/rsa.70108

Vancouver

Anastos M, Diskin S, Erde J, Kang M, Krivelevich M, Lichev L. Cycle Lengths in the Percolated Hypercube. Random Structures & Algorithms. 2026;69(4). doi:10.1002/rsa.70108

BibTeX
@article{Anastos2026,
  author = {Anastos, Michael and Diskin, Sahar and Erde, Joshua and Kang, Mihyun and Krivelevich, Michael and Lichev, Lyuben},
  title = {Cycle Lengths in the Percolated Hypercube},
  journal = {Random Structures & Algorithms},
  year = {2026},
  volume = {69},
  number = {4},
  doi = {10.1002/rsa.70108}
}
Kostenlos starten →