The blow-up of a graph is obtained by replacing every vertex with a finite collection of copies so that the copies of two vertices are adjacent if and only if the originals are. If every vertex is replaced with the same number of copies, then the resulting graph is called a balanced blow-up. We show that any graph which contains the maximum number of induced copies of a sufficiently large balanced blow-up of H is itself essentially a blow-up of H. This gives an asymptotic answer to a question in [2]. (C) 2014 Elsevier Inc. All rights reserved.
机构:
Southeast Univ, Dept Math, Nanjing 210018, Peoples R ChinaSoutheast Univ, Dept Math, Nanjing 210018, Peoples R China
Wang, Mingxin
Wei, Lei
论文数: 0引用数: 0
h-index: 0
机构:
Southeast Univ, Dept Math, Nanjing 210018, Peoples R China
Xuzhou Normal Univ, Sch Math Sci, Xuzhou 221116, Peoples R ChinaSoutheast Univ, Dept Math, Nanjing 210018, Peoples R China