All graphs with no more than 9 vertices either have an alpha-property (so the graph either belongs to a family where the independence number can be computed efficiently, or belongs to a family which can be identified efficiently and where the problem of computing the independence number can be reduced to that of computing the independence number on a smaller graph). n=10 is running now.

Advertisements