Abstract
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*} \text{ex}(n,K_{3,30}')=Ω(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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.