The Turán number for the edge blow-up of trees: the missing case

Abstract

The edge blow-up of a graph is the graph obtained from replacing each edge of it by a clique of the same size where the new vertices of the cliques are all different. Wang, Hou, Liu and Ma determined the Turán number of the edge blow-up of trees except one particular case. Answering an problem posed by them, we determined the Turán number of this particular case.