On the Turán number of 1-subdivision of K3,tK_{3,t}

preprint2020arXivOpen access

Abstract

For a graph HH, the 1-subdivision of HH, denoted by H′H', is the graph obtained by replacing the edges of HH by internally disjoint paths of length 2. Recently, Conlon, Janzer and Lee (arXiv: 1903.10631) asked the following question: For any integer s≥2s\ge2, estimate the smallest tt such that ex(n,Ks,t′)=Ω(n32−12s)\textup{ex}(n,K_{s,t}')=Ω(n^{\frac{3}{2}-\frac{1}{2s}}). In this paper, we consider the case s=3s=3. 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 tt from a magnitude of 105610^{56} to the number 3030. The construction is algebraic, which is based on some equations over finite fields.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.