Extremal graphs for edge blow-up of graphs

Long-Tu Yuan

Extremal graphs for edge blow-up of graphs

Combinatorics 2021-02-10 v2

Authors: Long-Tu Yuan

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\'{a}n numbers for edge blow-up of matchings were first studied by Erd\H{o}s and Moon. In this paper, we determine the Tur\'{a}n numbers for edge blow-up of general graphs.

Keywords

extremal graphs edge blow-up turán numbers clique matchings

Cite

@article{arxiv.1908.02025,
  title  = {Extremal graphs for edge blow-up of graphs},
  author = {Long-Tu Yuan},
  journal= {arXiv preprint arXiv:1908.02025},
  year   = {2021}
}

Comments

arXiv admin note: text overlap with arXiv:1903.10319

Related papers

View all related →