Need new lower bound

HCR`vr] is the next difficult graph. It has:

  • alpha=3
  • lovasz theta=3
  • cvetkovic=4
  • residue=2
  • max_even_minus_even_horizontal=2

So we need a new alpha-property or an efficiently-computable lower bound that gives us 3 here. This graph does not have any stable blocks.

Advertisements

One thought on “Need new lower bound

  1. Pingback: Another graph solved | The Independence Number Project

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