Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich. Minors, connectivity, and diameter in randomly perturbed sparse graphs. // European Journal of Combinatorics. – 2025. – DOI: 10.1016/j.ejc.2025.104152. – URL: https://doi.org/10.1016/j.ejc.2025.104152
Elad Aigner-Horev, Dan Hefetz, & Michael Krivelevich (2025). Minors, connectivity, and diameter in randomly perturbed sparse graphs. European Journal of Combinatorics. https://doi.org/10.1016/j.ejc.2025.104152
Elad Aigner-Horev, et al. “Minors, connectivity, and diameter in randomly perturbed sparse graphs.” European Journal of Combinatorics, 2025. doi:10.1016/j.ejc.2025.104152.
@article{AignerHorev2025,
title = {Minors, connectivity, and diameter in randomly perturbed sparse graphs},
author = {Aigner-Horev, Elad and Hefetz, Dan and Krivelevich, Michael},
journal = {European Journal of Combinatorics},
year = {2025},
doi = {10.1016/j.ejc.2025.104152},
url = {https://doi.org/10.1016/j.ejc.2025.104152}
}