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

Pingback: Another graph solved | The Independence Number Project