paper

The Turán number of the Cartesian product of a star and an edge

arXiv:2604.11366

Abstract

Let denote the cycle of length , be a star with edges. And let be the graph consisting of copies of sharing one fixed edge. Equivalently, , which is the Cartesian product of a star with edges and an edge. Recently, Gao, Janzer, Liu and Xu [\textit{Israel J. Math. 269(2025)}] proved that the Turán number of is for every . In this paper, we obtain upper and lower estimates for the Turán number of in both the general and bipartite settings for every . For the lower bound, we use random construction based on the extremal structure of . These results imply that , and In the case of , we obtain sharper estimates. We show that the Turán number of is approximately between and . And in the bipartite setting, it is approximately between and . Moreover, in the bipartite setting, we give a more general result, which shows that for every tree with edges, the bipartite Turán number of is at most .