加载中…
We show that, for any graph and , there exists a such that every -vertex -regular graph with has a collection of vertex-disjoint -subdivisions covering at least vertices. This verifies a conjecture of Verstraëte from 2002 and improves a recent result of Letzter, Methuku and Sudakov which additionally required to be at least polylogarithmic in .

生成讲解博客的中文版本

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