ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a realizable graph. A clique cover of HH is a collection of cliques whose union covers all edges of HH, and let nn be the smallest number of cliques in such a cover. Minimal-clique-cover conjecture. There is always a digraph GG realizing HH with

∣VG∣=n.|V_G|=n.

Equivalently, the theorem characterizing realizability continues to hold when the number of cliques is required to be minimal. This would make the decidability algorithm substantially more efficient by restricting the search to minimum-size clique covers; the source gives no resolution of the conjecture.

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.