Extremal Graphs for Blow-Ups of Cycles and Trees

Electronic Journal Of Combinatorics

Hong Liu¹ 

关键词: Extremal graphs;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

The blow-up of a graph H is the graph obtained from replacing each edge in H by a clique of the same size where the new vertices of the cliques are all different. Erdős et al. and Chen et al. determined the extremal number of blow-ups of stars. Glebov det

【 授权许可】

Others