| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656831 | Journal of Combinatorial Theory, Series B | 2014 | 17 Pages |
Abstract
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].
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hamed Hatami, James Hirst, Serguei Norine,