Patrick just pointed out this amazing database to me of graph classes where the independence number can be efficently computed. We should be able to use this to knock out some difficult graphs. Soon we’ll be to the point where we have to move our computations to a bigger machine, and then to where we need to write our own generators – to only generate potential difficult graphs.

Advertisements