Extremal graphs for edge blow-up of graphs

Abstract

Given a graph $H$ and an integer $p$, the {\it edge blow-up} of $H$, denoted as $H^{p+1}$, is the graph obtained from replacing each edge in $H$ by a clique of size $p+1$ where the new vertices of the cliques are all different. The Turán numbers for edge blow-up of matchings were first studied by Erdős and Moon. In this paper, we determine the Turán numbers for edge blow-up of general graphs.

arXiv admin note: text overlap with arXiv:1903.10319