Induced subdivisions of $K_{d+1}$ in graphs of high girth
Combinatorics
2026-03-11 v1
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\"uhn and Osthus (originally attributed to Shi).
Cite
@article{arxiv.2603.09521,
title = {Induced subdivisions of $K_{d+1}$ in graphs of high girth},
author = {António Girão and Zach Hunter},
journal= {arXiv preprint arXiv:2603.09521},
year = {2026}
}
Comments
11 pages, comments welcome!