科研之友
微信
新浪微博
Facebook
分享链接
摘要
The edge blow-up of a graph is the graph obtained from replacing each edge of it by a clique of the same size where the new vertices of the cliques are all different. Wang, Hou, Liu and Ma determined the Turan number of the edge blow-up of trees except one particular case. Answering a problem posed by them, we determined the Turan number of this particular case.
