n=9 solved!

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

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s