Graphs with a Small Number of Distinct Induced Subgraphs
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced subgraphs of G is at most εn2, where ε < 10−21, then either G or its complement contain an independent set on at least (1 - 4ε)n vertices. This settles a problem of Erdõs and Hajnal. © 1989, Elsevier Inc.
Annals of Discrete Mathematics
Alon, N., & Bollobás, B. (1989). Graphs with a Small Number of Distinct Induced Subgraphs. Annals of Discrete Mathematics, 43 (C), 23-30. https://doi.org/10.1016/S0167-5060(08)70562-4