ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be an oriented graph and let kk be a positive integer. The underlying graph of DD is the graph obtained by ignoring the orientations of its arcs.

Oriented chordal hull-number conjecture. Determining whether

hn⁡→(D)≤k\overrightarrow{\operatorname{hn}}(D)\leq k

is NP-complete, even when the underlying graph of DD is chordal.

This would extend the known NP-hardness of determining the hull number of an undirected chordal graph to oriented graphs. The source presents the claim as an open problem; its precise complexity for oriented graphs with chordal underlying graphs remains 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.