The vertex-maximum-clique criterion for weakly perfect graphs
Statement
Let be a weakly perfect graph, meaning that its clique number and chromatic number agree, . A vertex is contained in a maximum clique of if it belongs to a clique of size .
Vertex-maximum-clique criterion. Any weakly perfect graph is a perfect graph if each vertex is in some maximum clique of .
The claim proposes a sufficient condition for weak perfection to extend from the graph itself to every induced subgraph, which is the defining requirement for perfection. The supplied text gives no independent resolution or discussion of the claim; its status is therefore open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.