no code implementations • 9 Dec 2020 • Noga Alon, Michel Krivelevich
We prove that for every graph $H$ of maximum degree at most $3$ and for every positive integer $q$ there is a finite $f=f(H, q)$ such that every $K_f$-minor contains a subdivision of $H$ in which every edge is replaced by a path whose length is divisible by $q$.
Combinatorics 05C53, 05C83, 05C38