Perfection is an alpha-property

If a graph is perfect, then the independence number can be computed efficiently: Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul Seymour and Kristina Vušković proved that Berge graphs can be recognized efficiently. The Strong Perfect Graph Theorem says that a graph is perfect if, and only if, it is Berge. The independence number equals the Lovasz number for perfect graphs. And it can be computed efficiently. Sage has a built-in test .is_perfect()

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