Extremal graphs for edge blow-up of graphs

2019/08/06 by Yuan, Long-Tu · 3 citations
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1908.02025

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.

Cited by

• How to find all extremal graphs using symmetric subgraphs
• On the Turán number of odd-ballooning of 3-chromatic graphs
• The spectral Turán problem: Characterizing spectral-consistent graphs

Related

• Extremal graphs for edge blow-up of lollipops
• Generalized Turan number for the edge blow-up graph
• The Turán number for the edge blow-up of trees: the missing case
• The Turán number for the edge blow-up of trees
• Spectral extremal graphs for edge blow-up of star forests