A proof of lobb revisited

Bhogle, Srinivas (1986) A proof of lobb revisited. Technical Report. National Aeronautical Laboratory, Bangalore, India.

[img] PDF
tr_pd_du_8601_R67187.pdf
Restricted to Repository staff only

Download (305kB)

Abstract

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.

Item Type: Monograph (Technical Report)
Uncontrolled Keywords: Perfect graph;Normal hypergraph;Helly property;Strong perfect graph conjecture13;
Subjects: MATHEMATICAL AND COMPUTER SCIENCES > Mathematical and Computer Scienes(General)
Depositing User: Users 64 not found.
Date Deposited: 22 Jul 2006
Last Modified: 24 May 2010 04:16
URI: http://nal-ir.nal.res.in/id/eprint/2269

Actions (login required)

View Item View Item