ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a weakly perfect graph, meaning that its clique number and chromatic number agree, ω(G)=χ(G)\omega(G)=\chi(G). A vertex v∈V(G)v\in V(G) is contained in a maximum clique of GG if it belongs to a clique of size ω(G)\omega(G).

Vertex-maximum-clique criterion. Any weakly perfect graph GG is a perfect graph if each vertex v∈V(G)v\in V(G) is in some maximum clique of GG.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.