加载中…
In this paper, we prove that there exists an absolute constant such that, for every integer , every graph with and contains an induced subdivision of . This fully resolves a problem raised by Kühn and Osthus (originally attributed to Shi), and improves a recent result of Girão and Hunter. Our proof uses some ideas from Girão and Hunter. Another main ingredient in our proof is an induced variant of Mader’s theorem: for every fixed , every graph with , and sufficiently large girth contains an induced subdivision of .

生成讲解博客的中文版本

生成AI智能校验的中文版本