Induced subdivisions of in graphs of high girth
arXiv:2603.09521
Abstract
In this paper, we show that for all , every graph with minimum degree and girth at least contains an induced subdivision of a . This answers a problem asked by Kühn and Osthus (originally attributed to Shi).
11 pages, comments welcome!