A proof of lobb revisited

The Strong Perfect Graph Conjecture of Claude Berge is now nearly 25 years old. Efforts to resolve the conjecture almost always use an approach which is quot;graphicalquot; in spirit. A proof by Lobb threw open the interesting possibility that the hypergraph, instead of the graph, could be employed to resolve the conjecture. Here, we study Lobb's theorem in some detail, propose a simpler proof, but end up discovering that this approach can at best help verify the strong conjecture for special classes of graphs. The winning proof is, probably, still very far away