Packing subdivisions into regular graphs
Proceedings of the American Mathematical Society · 15.06.2026
DOI: 10.1090/proc/17684 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the American Mathematical Society, online erschienen am 15.06.2026. Verfasst von Richard Montgomery und 3 weiteren Autor:innen. Die Arbeit nennt 28 Literaturangaben. Gefördert von: H2020 European Research Council, Horizon 2020.
Abstract (Originalsprache)
We show that, for any graph F F and η > 0 \eta >0 , there exists a d 0 = d 0 ( F , η ) d_0=d_0(F,\eta ) such that every n n -vertex d d -regular graph with d ≥ d 0 d \geq d_0 has a collection of vertex-disjoint F F -subdivisions covering at least ( 1 − η ) n (1-\eta )n vertices. This verifies a conjecture of Verstraëte from 2002 and improves a recent result of Letzter, Methuku and Sudakov which additionally required d d to be at least polylogarithmic in n n .
Förderung
- H2020 European Research Council
- Horizon 2020
Zitieren
APA
Montgomery, R., Petrova, K., Ranganathan, A., & Tan, J. (2026). Packing subdivisions into regular graphs. Proceedings of the American Mathematical Society. https://doi.org/10.1090/proc/17684
Vancouver
Montgomery R, Petrova K, Ranganathan A, Tan J. Packing subdivisions into regular graphs. Proceedings of the American Mathematical Society. 2026. doi:10.1090/proc/17684
BibTeX
@article{Montgomery2026,
author = {Montgomery, Richard and Petrova, Kalina and Ranganathan, Arjun and Tan, Jane},
title = {Packing subdivisions into regular graphs},
journal = {Proceedings of the American Mathematical Society},
year = {2026},
doi = {10.1090/proc/17684}
}
EUVIMED