Excluding as a fat minor
arXiv:2510.14644
Abstract
We prove that for every , the graph satisfies the fat minor conjecture of Georgakopoulos and Papasoglu: for every there exist such that every graph with no -fat minor is -quasi-isometric to a graph with no minor. We use this to obtain an efficient algorithm for approximating the minimal multiplicative distortion of any embedding of a finite graph into a -minor-free graph, answering a question of Chepoi, Dragan, Newman, Rabinovich, and Vaxès from 2012.