Given a graph H and an integer p, the edge blow-up Hp+1 of is obtained from replacing each in by clique order p+1 where new vertices cliques are all distinct. The Turán numbers for matchings were first studied Erdős Moon. In this paper, we determine range bipartite graphs exact non-bipartite graphs. addition, characterize extremal Our results also extend several known results, including stars, ...