n=10 solved!

Patrick added the fact Alain Hertz had alerted me to, namely that the independence number of skew-starfree (S_{1,2,3}-free) graphs can be computed efficiently. He then added a test for skew-start free graphs. The last difficult graph I?bbrr[ko was indeed skew-star free, the independence numbers of the remaining graphs of order 10 can be computed efficiently, and now Patrick is running graphs of order 11. So I?bbrr[ko is solved. On to n=11!

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