2000 character limit reached
Excluding $K_{2,t}$ as a fat minor
Published 16 Oct 2025 in math.CO, cs.CG, cs.DM, and math.MG | (2510.14644v1)
Abstract: We prove that for every $t \in \mathbb{N}$, the graph $K_{2,t}$ satisfies the fat minor conjecture of Georgakopoulos and Papasoglu: for every $K\in \mathbb{N}$ there exist $M,A\in \mathbb{N}$ such that every graph with no $K$-fat $K_{2,t}$ minor is $(M,A)$-quasi-isometric to a graph with no $K_{2,t}$ minor. We use this to obtain an efficient algorithm for approximating the minimal multiplicative distortion of any embedding of a finite graph into a $K_{2,t}$-minor-free graph, answering a question of Chepoi, Dragan, Newman, Rabinovich, and Vax`es from 2012.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.