The inducibility of blow-up graphs

被引:18
|
作者
Hatami, Hamed [1 ]
Hirst, James [1 ]
Norine, Serguei [2 ]
机构
[1] McGill Univ, Sch Comp Sci, Montreal, PQ, Canada
[2] McGill Univ, Dept Math, Montreal, PQ H3A 2K6, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Induced subgraphs; Inducibility; Blow-up; COMPLETE BIPARTITE GRAPHS; MAXIMAL NUMBER; SUBGRAPHS;
D O I
10.1016/j.jctb.2014.06.005
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:196 / 212
页数:17
相关论文
共 50 条
  • [21] Numerical detection of blow-up: a new sufficient condition for blow-up
    Chien-Hong Cho
    Japan Journal of Industrial and Applied Mathematics, 2016, 33 : 81 - 98
  • [22] Numerical detection of blow-up: a new sufficient condition for blow-up
    Cho, Chien-Hong
    JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2016, 33 (01) : 81 - 98
  • [23] BLOW-UP OR NOT BLOW-UP AT THE HYPERBOLIC BOUNDARY FOR A SYSTEM FROM CHEMISTRY?
    Bourdarias, Christian
    Gisclon, Marguerite
    Junca, Stephane
    HYPERBOLIC PROBLEMS: THEORY, NUMERICS, APPLICATIONS, 2014, 8 : 615 - 622
  • [24] MORE BLOW-UP
    FLINT, RW
    NEW REPUBLIC, 1967, 156 (10) : 34 - 34
  • [25] Blow-Up Bungalows
    Ewalt, David M.
    FORBES, 2011, 187 (11): : 158 - 159
  • [26] Homogenization by blow-up
    Braides, Andrea
    Maslennikov, Mikhail
    Sigalotti, Laura
    APPLICABLE ANALYSIS, 2008, 87 (12) : 1341 - 1356
  • [27] Contact blow-up
    Casals, Roger
    Pancholi, Dishant M.
    Presas, Francisco
    EXPOSITIONES MATHEMATICAE, 2015, 33 (01) : 78 - 100
  • [28] The Blow-up Lemma
    Komlós, J
    COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (1-2): : 161 - 176
  • [29] THE BIG BLOW-UP
    YOUNGER, I
    ABA JOURNAL, 1987, 73 : 120 - 120
  • [30] BLOW-UP IN CITIES
    不详
    NEW REPUBLIC, 1967, 157 (6-7) : 5 - 7