My students and colleagues know graph E?ow as “the killer” because it is a counterexample to a great many conjectures. After implementing Pepper’s idea of iterating the current lower bounds over the subgraphs induced on the even levels with respect to the vertices, I reported to him that there still wasn’t equality of alpha and this improved lower bound for alpha for all graphs. He asked for an example. Amazingly the killer reared its ugly head! Its the smallest graph that was an example.
Clearly, iterating the lower bounds over the even levels will never work here. What I didn’t include was an initial calculation of the theoretical lower bound before moving on to the even levels. Since residue of the killer equals 4, this graph will be solved.