加载中…
For a graph , the 1-subdivision of , denoted by , is the graph obtained by replacing the edges of by internally disjoint paths of length 2. Recently, Conlon, Janzer and Lee (arXiv: 1903.10631) asked the following question: For any integer , estimate the smallest such that . In this paper, we consider the case . More precisely, we provide an explicit construction giving \begin{align*} (n,K_{3,30}')=\Omega(n^{\frac{4}{3}}), \end{align*} which reduces the estimation for the smallest value of from a magnitude of to the number . The construction is algebraic, which is based on some equations over finite fields.

生成讲解博客的中文版本

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