Das, ShagnikShagnikDasDraganić, NemanjaNemanjaDraganićSteiner, RaphaelRaphaelSteiner2024-01-262024-01-262024-03-0100958956https://scholars.lib.ntu.edu.tw/handle/123456789/638953Alon and Krivelevich proved that for every n-vertex subcubic graph H and every integer q≥2 there exists a (smallest) integer f=f(H,q) such that every Kf-minor contains a subdivision of H in which the length of every subdivision-path is divisible by q. Improving their superexponential bound, we show that [Formula presented], which is optimal up to a constant multiplicative factor.journal article10.1016/j.jctb.2023.10.0112-s2.0-85177206958https://api.elsevier.com/content/abstract/scopus_id/85177206958